feat(leetcode): solve 235 - Lowest Common Ancestor Of A Binary Search Tree

Author: arnav-on-code

README.md

@@ -22,24 +22,24 @@ Total	125
 
 | Field | Value |
 |------|------|
-| Problem ID | 124 |
-| Title | Binary Tree Maximum Path Sum |
+| Problem ID | 235 |
+| Title | Lowest Common Ancestor Of A Binary Search Tree |
 | Language | Python3 |
-| Runtime | 4 ms |
-| Memory | 23.9 MB |
+| Runtime | 66 ms |
+| Memory | 22.8 MB |
 
 
 💻 Languages Used
 
-- **Python3** : 23
+- **Python3** : 24
 
 ## 📚 Recent Accepted Problems
 
+- 235 Lowest Common Ancestor Of A Binary Search Tree
 - 124 Binary Tree Maximum Path Sum
 - 789 Kth Largest Element In A Stream
 - 1127 Last Stone Weight
 - 1014 K Closest Points To Origin
-- 295 Find Median From Data Stream
 
 
 ---
@@ -81,4 +81,4 @@ Git
 GitHub
 ⏰ Last Sync
 
-2026-07-06 19:56:23
+2026-07-06 19:56:24

storage/solutions/0235_Lowest_Common_Ancestor_Of_A_Binary_Search_Tree/metadata.json

@@ -0,0 +1,11 @@
+{
+    "submission_id": "2046953410",
+    "question_id": "235",
+    "title_slug": "lowest-common-ancestor-of-a-binary-search-tree",
+    "language": "python3",
+    "language_verbose": "Python3",
+    "runtime": "66 ms",
+    "memory": "22.8 MB",
+    "status_code": 10,
+    "timestamp": 1782487150
+}

storage/solutions/0235_Lowest_Common_Ancestor_Of_A_Binary_Search_Tree/solution.py

@@ -0,0 +1,17 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution:
+    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
+
+        if p.val < root.val and q.val< root.val:
+            return self.lowestCommonAncestor(root.left, p, q)
+        elif p.val > root.val and q.val> root.val:
+            return self.lowestCommonAncestor(root.right, p, q)
+        else:
+            return root
+        

storage/state.json

@@ -1,3 +1,3 @@
 {
-    "last_submission_id": "2050276621"
+    "last_submission_id": "2048068140"
 }

storage/stats.json

@@ -4,9 +4,13 @@
     "medium": 56,
     "hard": 6,
     "languages": {
-        "Python3": 23
+        "Python3": 24
     },
     "recent_problems": [
+        {
+            "id": "235",
+            "title": "Lowest Common Ancestor Of A Binary Search Tree"
+        },
         {
             "id": "124",
             "title": "Binary Tree Maximum Path Sum"
@@ -22,18 +26,14 @@
         {
             "id": "1014",
             "title": "K Closest Points To Origin"
-        },
-        {
-            "id": "295",
-            "title": "Find Median From Data Stream"
         }
     ],
     "last_problem": {
-        "id": "124",
-        "title": "Binary Tree Maximum Path Sum",
+        "id": "235",
+        "title": "Lowest Common Ancestor Of A Binary Search Tree",
         "language": "Python3",
-        "runtime": "4 ms",
-        "memory": "23.9 MB"
+        "runtime": "66 ms",
+        "memory": "22.8 MB"
     },
-    "last_sync": "2026-07-06 19:56:23"
+    "last_sync": "2026-07-06 19:56:24"
 }