Create 235-lowest-common-ancestor-of-a-binary-search-tree.js

Author: everthis

235-lowest-common-ancestor-of-a-binary-search-tree.js

@@ -0,0 +1,19 @@
+/**
+ * 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}
+ */
+const lowestCommonAncestor = function(root, p, q) {
+    while((root.val - p.val) * (root.val - q.val) > 0) {
+          root = root.val > p.val ? root.left : root.right
+    }
+    return root
+};