Time: 58 ms (97.63%), Space: 59.6 MB (18.39%) - LeetHub

Author: chappdev2019

0235-lowest-common-ancestor-of-a-binary-search-tree/0235-lowest-common-ancestor-of-a-binary-search-tree.js

@@ -0,0 +1,29 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+
+/**
+ * @param {TreeNode} root
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {TreeNode}
+ */
+
+var lowestCommonAncestor = function (root, p, q) {
+    while(root!=null) {
+        if (root.val > p.val && root.val > q.val) {
+            root = root.left; 
+        }
+        else if (root.val < p.val && root.val < q.val) {
+            root = root.right;
+        }
+        else {
+            return root;
+        }
+    }
+    return root;
+};