Online Python Compiler

class Node: def __init__(self, my_data): self.right = None self.data = my_data self.left = None class binary_tree_to_list: def __init__(self): self.root = None self.head = None self.tail = None def convert_tree_to_list(self, node_val): if node_val is None: return self.convert_tree_to_list(node_val.left) if (self.head == None) : self.head = self.tail = node_val else: self.tail.right = node_val node_val.left = self.tail self.tail = node_val self.convert_tree_to_list(node_val.right) def print_it(self): curr = self.head if (self.head == None): print("The list is empty") return print("The nodes are :") while curr != None: print(curr.data) curr = curr.right my_instance = binary_tree_to_list() print("Elements are being added to the list") my_instance.root = Node(10) my_instance.root.left = Node(14) my_instance.root.right = Node(17) my_instance.root.left.left = Node(22) my_instance.root.left.right = Node(29) my_instance.root.right.left = Node(45) my_instance.root.right.right = Node(80) my_instance.convert_tree_to_list(my_instance.root) my_instance.print_it()