bin_tree_quest

class BinaryTree:
    def __init__(self, root):
        self.root = Node(root)

    def preorder(self, root):
        if root is None:
            return
        print(root.data, end=" ,")
        self.preorder(root.left)
        self.preorder(root.right)

    def depth(self, node):
        # TODO
        pass


tree = BinaryTree(1)
tree.root.left = Node(2)
tree.root.right = Node(3)
tree.root.left.left = Node(4)
tree.root.left.left.left = Node(5)
print(tree.preorder(tree.root))
print("-----")
print(tree.depth(tree.root))