Update Lowest Common Ancestor of a Binary Search Tree.java

varunu28 · web-flow · commit e4e589d3ee5f · 2021-07-19T07:56:44.000-07:00
diff --git a/Easy/Lowest Common Ancestor of a Binary Search Tree.java b/Easy/Lowest Common Ancestor of a Binary Search Tree.java
@@ -7,22 +7,16 @@
  *     TreeNode(int x) { val = x; }
  * }
  */
+
 class Solution {
   public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
-    if (root == null || p == null || q == null) {
-      return null;
-    }
-    if (root == p || root == q) {
-      return root;
-    }
-    if ((root.val > p.val && root.val < q.val) || (root.val < p.val && root.val > q.val)) {
+    if (root == p || root == q || 
+        (p.val > root.val && q.val < root.val) || 
+        (p.val < root.val && q.val > root.val)) {
       return root;
     }
-    if (root.val > p.val && root.val > q.val) {
-      return lowestCommonAncestor(root.left, p, q);
-    }
-    else {
-      return lowestCommonAncestor(root.right, p, q);
-    }
+    return ((root.val > p.val && root.val > q.val) ? 
+            lowestCommonAncestor(root.left, p, q) : 
+            lowestCommonAncestor(root.right, p, q));
   }
 }
