change TheAlgorithms#5

Author: sohamsshah

data_structures/binary_tree/kth_smallest_value_in_a_binary_search_tree.py

@@ -11,12 +11,6 @@ def __init__(self, data: int) -> None:
         self.data = data
         self.left: Optional[Node] = None
         self.right: Optional[Node] = None
-        
-def display(tree: Optional[Node]) -> None: 
-    if tree:
-        display(tree.left)
-        print(tree.data)
-        display(tree.right)
 
 def kthSmallest(root: Node, k: int) -> int: 
     """
@@ -46,9 +40,6 @@ def main() -> None:
     tree.left.left.left = Node(1)
     k = 2  
     print(f"The {k}th Smallest Value in the BST is:", kthSmallest(tree, k))
-    print("Tree is: ")
-    display(tree)
-
 
 if __name__ == "__main__":
     main()