diff --git a/data_structures/binary_tree/basic_binary_tree.py b/data_structures/binary_tree/basic_binary_tree.py
index caba13ca2..a31b1847d 100644
--- a/data_structures/binary_tree/basic_binary_tree.py
+++ b/data_structures/binary_tree/basic_binary_tree.py
@@ -11,6 +11,23 @@ class Node:
         self.left: Node | None = None
         self.right: Node | None = None
 
+def display(tree: Node | None) -> None:  # In Order traversal of the tree
+    """
+    >>> root = Node(1)
+    >>> root.left = Node(0)
+    >>> root.right = Node(2)
+    >>> display(root)
+    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:
     """
@@ -92,7 +109,7 @@ 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)
 
 
 if __name__ == "__main__":