[알고리즘] 링크드리스트 print_all구현

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

node = Node(3)
first_node = Node(4)
node.next = first_node
print(node.next.data)


class LinkedList:
    def __init__(self, data):
        self.head = Node(data)

    def append(self, data):
      
        if self.head is None:
            self.head = Node(data)
            return
        
        cur = self.head
        while cur.next is not None:
            cur = cur.next
        cur.next = Node(data)


    def print_all(self):
        cur = self.head
        while cur is not None:
            print(cur.data)
            cur = cur.next

print('여기')
linked_list = LinkedList(3)
linked_list.append(4)
linked_list.append(5)
linked_list.append(6)
linked_list.print_all()

cur변수에 head를 넣고 끝까지 돌면서 cur을 프린트하는데

cur을 하나씩 next로 간다