changes TheAlgorithms#7

Author: sohamsshah

data_structures/binary_tree/kth_smallest_value_in_a_binary_search_tree.py

@@ -40,4 +40,4 @@ def kthSmallest(root: Node, k: int) -> int:
     tree.left.right = Node(4)
     tree.left.left.left = Node(1)
     k = 2  
-    print(f"The {k}th Smallest Value in the BST is:", kthSmallest(tree, k))
+    print("The " + str(k) + "-th Smallest Value in the BST is: " + str(kthSmallest(tree, k)))