236. 二叉树的最近公共祖先

思考边界条件

/**
 * 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||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){   //当左右节点都不为null
            return root;
        }

        if(left!=null){                //左边不等于null
            return left;
        }

        if(right!=null){               //右边不等于Null
            return right;
        }

        return null;

    }
}