Update basic_binary_tree.py

for more information, see https://pre-commit.ci

data_structures/binary_tree/basic_binary_tree.py

@@ -12,20 +12,38 @@ class Node:
         self.right: Node | None = None
 
 
-def display_tree(root: Node | None, level: int = 0) -> None:
+def display(tree: Node | None) -> None:  # In Order traversal of the tree
     """
     >>> root = Node(1)
-    >>> root.left = Node(2)
+    >>> root.left = Node(0)
-    >>> root.right = Node(3)
+    >>> root.right = Node(2)
-    >>> display_tree(root)
+    >>> display(root)
-        3
+    0
     1
     2
+    >>> display(root.right)
+    2
+    """
+    if tree:
+        display(tree.left)
+        print(tree.data)
+        display(tree.right)
+
+
+def display_using_in_order_traversal(root: Node | None, level: int = 0) -> None:
+    """
+    >>> root = Node(1)
+    >>> root.left = Node(0)
+    >>> root.right = Node(2)
+    >>> display_tree(root)
+        2
+    1
+        0
     """
     if root:
-        display_tree(root.right, level + 1)
+        display_using_in_order_traversal(root.right, level + 1)
-        print("    " * level + str(root.data))
+        print(f"{'    ' * level}{root.data}")
-        display_tree(root.left, level + 1)
+        display_using_in_order_traversal(root.left, level + 1)
 
 
 def depth_of_tree(tree: Node | None) -> int:
@@ -92,7 +110,8 @@ def main() -> None:  # Main function for testing.
     print(is_full_binary_tree(tree))
     print(depth_of_tree(tree))
     print("Tree is: ")
-    display_tree(tree)
+    display_using_in_order_traversal(tree)
+    display(tree)
 
 
 if __name__ == "__main__":