solve lowest common ancestor of a binary search tree

Author: sora0319

lowest-common-ancestor-of-a-binary-search-tree/sora0319.java

@@ -0,0 +1,15 @@
+public class Solution {
+    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
+        TreeNode node = root;
+        while (node != null) {
+            if (p.val < node.val && q.val < node.val) {
+                node = node.left;
+            } else if (node.val < p.val && node.val < q.val) {
+                node = node.right;
+            } else {
+                return node;
+            }
+        }
+        return null;
+    }
+}