EASY/src/easy/LowestCommonAncestorOfABinarySearchTree.java

fishercoder1534 · fishercoder1534 · commit 63632897fbf5 · 2016-09-10T11:03:37.000-07:00
diff --git a/EASY/src/easy/LowestCommonAncestorOfABinarySearchTree.java b/EASY/src/easy/LowestCommonAncestorOfABinarySearchTree.java
@@ -0,0 +1,20 @@
+package easy;
+
+import classes.TreeNode;
+
+public class LowestCommonAncestorOfABinarySearchTree {
+    //After drawing out the tree and run it manually, made it AC'ed easily! Cheers!
+
+    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
+        if(root == null || p == root || q == root) return root;
+        if((root.val - p.val) * (root.val - q.val) <= 0) return root;
+        if((root.val - p.val) * (root.val - q.val) > 0 && (root.val - q.val) > 0) {
+            return lowestCommonAncestor(root.left, p, q);
+        }
+        if((root.val - p.val) * (root.val - q.val) > 0 && (root.val - q.val) < 0) {
+            return lowestCommonAncestor(root.right, p, q);
+        }
+        return root;
+    }
+
+}
