Algorithm-practice | 어디 한 번 꾸준히 풀어보자 알고리듬

def create_tree():
    # First line
    two = Node(2)
    # Second line
    seven = Node(7)
    nine = Node(9)
    two.add_left(seven)
    two.add_right(nine)
    # Third line
    one = Node(1)
    six = Node(6)
    eight = Node(8)
    seven.add_left  

def remove(self, item):
        prev_node = self.head
        current_node = prev_node.next

        while current_node:
            if current_node.data == item:
                break

            prev_node = current_node
            current_node =   

def remove(self, item):
        prev_node = self.head
        current_node = prev_node.next

        while current_node:
            if current_node.data == item:
                break
            prev_node = current_node
            current_node = c