Update Kth Smallest Element in a BST - Leetcode 230.py

Author: gahogg

Kth Smallest Element in a BST - Leetcode 230.py

@@ -14,12 +14,13 @@ def dfs(node):
                 return
 
             dfs(node.left)
-            count[0] = count[0] - 1
 
-            if count[0] == 0:
+            if count[0] == 1:
                 ans[0] = node.val
+            
+            count[0] = count[0] - 1
 
-            if k > 0:
+            if count[0] > 0:
                 dfs(node.right)
 
         dfs(root)