feat(leetcode): solve 230 - Kth Smallest Element In A Bst

Author: arnav-on-code

README.md

@@ -22,24 +22,24 @@ Total	125
 
 | Field | Value |
 |------|------|
-| Problem ID | 226 |
-| Title | Invert Binary Tree |
+| Problem ID | 230 |
+| Title | Kth Smallest Element In A Bst |
 | Language | Python3 |
 | Runtime | 0 ms |
-| Memory | 19.1 MB |
+| Memory | 22.1 MB |
 
 
 💻 Languages Used
 
-- **Python3** : 26
+- **Python3** : 27
 
 ## 📚 Recent Accepted Problems
 
+- 230 Kth Smallest Element In A Bst
 - 226 Invert Binary Tree
 - 104 Maximum Depth Of Binary Tree
 - 235 Lowest Common Ancestor Of A Binary Search Tree
 - 124 Binary Tree Maximum Path Sum
-- 789 Kth Largest Element In A Stream
 
 
 ---
@@ -81,4 +81,4 @@ Git
 GitHub
 ⏰ Last Sync
 
-2026-07-06 19:56:28
+2026-07-06 19:56:30

storage/solutions/0230_Kth_Smallest_Element_In_A_Bst/metadata.json

@@ -0,0 +1,11 @@
+{
+    "submission_id": "2045534339",
+    "question_id": "230",
+    "title_slug": "kth-smallest-element-in-a-bst",
+    "language": "python3",
+    "language_verbose": "Python3",
+    "runtime": "0 ms",
+    "memory": "22.1 MB",
+    "status_code": 10,
+    "timestamp": 1782376047
+}

storage/solutions/0230_Kth_Smallest_Element_In_A_Bst/solution.py

@@ -0,0 +1,19 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+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 k ==0:
+                return root.val
+            root = root.right

storage/state.json

@@ -1,3 +1,3 @@
 {
-    "last_submission_id": "2045552347"
+    "last_submission_id": "2045547332"
 }

storage/stats.json

@@ -4,9 +4,13 @@
     "medium": 56,
     "hard": 6,
     "languages": {
-        "Python3": 26
+        "Python3": 27
     },
     "recent_problems": [
+        {
+            "id": "230",
+            "title": "Kth Smallest Element In A Bst"
+        },
         {
             "id": "226",
             "title": "Invert Binary Tree"
@@ -22,18 +26,14 @@
         {
             "id": "124",
             "title": "Binary Tree Maximum Path Sum"
-        },
-        {
-            "id": "789",
-            "title": "Kth Largest Element In A Stream"
         }
     ],
     "last_problem": {
-        "id": "226",
-        "title": "Invert Binary Tree",
+        "id": "230",
+        "title": "Kth Smallest Element In A Bst",
         "language": "Python3",
         "runtime": "0 ms",
-        "memory": "19.1 MB"
+        "memory": "22.1 MB"
     },
-    "last_sync": "2026-07-06 19:56:28"
+    "last_sync": "2026-07-06 19:56:30"
 }