Simple Java solution


  • 7
    A
    /**
     * Definition for a binary tree node.
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;
     *     TreeNode(int x) { val = x; }
     * }
     */
    public class Solution {
        public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
            if (p == null || q == null || root == null){
                return null;
            }
            if (p.val < root.val && q.val < root.val){
                return lowestCommonAncestor (root.left, p , q);
            }
            else if (p.val > root.val && q.val > root.val){
                return lowestCommonAncestor (root.right, p , q);
            }
            else {
                return root;
            }
        }
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.