solve: kth-smallest-element-in-a-bst

Author: coloryourlife

kth-smallest-element-in-a-bst/Raft.py

@@ -0,0 +1,16 @@
+class Solution:
+    def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:
+        stack = []
+        
+        while True:
+            while root:
+                stack.append(root)
+                root = root.left
+            root = stack.pop()
+            k -= 1
+            if not k:
+                return root.val
+            root = root.right
+# T: O(n)
+# S: O(n)
+