kth_smallest_value_in_a_binary_search_tree

Author: sohamsshah

data_structures/binary_tree/kth_smallest_value_in_a_binary_search_tree.py

@@ -1,7 +1,6 @@
-
 from typing import Optional
 
-        
+    
 class Node:
     """
     A Node has data variable and pointers to Nodes to its left and right.
@@ -12,6 +11,7 @@ def __init__(self, data: int) -> None:
         self.left: Optional[Node] = None
         self.right: Optional[Node] = None
 
+
 def kthSmallest(root: Node, k: int) -> int: 
     """
     In a BST, the Inorder Traversal returns ascending order of the data when traversed.
@@ -31,6 +31,7 @@ def kthSmallest(root: Node, k: int) -> int:
             root = root.right
     return temp[k - 1]
 
+
 if __name__ == "__main__":
     tree = Node(5)
     tree.left = Node(3)