Add 235_Lowest_Common_Ancestor_of_a_Binary_Search_Tree.java

Author: Sean Prashad

Tree Depth First Search/235_Lowest_Common_Ancestor_of_a_Binary_Search_Tree.java

@@ -0,0 +1,15 @@
+class Solution {
+ public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode 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 {
+ break;
+ }
+ }
+
+ return root;
+ }
+}