[:fixed]

Author: ppxyn1

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

@@ -17,6 +17,7 @@ def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:
             return
 
         while curr or stack:
+            while curr:
                 stack.append(curr)
                 curr = curr.left 
             curr = stack.pop()
@@ -27,5 +28,3 @@ def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:
 
             curr = curr.right 
 
-
-