Simple Java solution


  • 0
    E

    /**

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

Log in to reply
 

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