1st round, 236 Lowest Common Ancestor of a Binary Tree

这道题就是我上一篇中提到的返回 节点的题！！有必要写在一起，进行逻辑 和 代码结构上的对比！

/**
 * 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(root==null) return null;
        if(root==p || root==q) return root; // actually you can combine the last two statements together
        
        TreeNode left=lowestCommonAncestor(root.left, p, q);
        TreeNode right=lowestCommonAncestor(root.right, p, q);
        if(left!=null && right!=null) return root;
        if(left==null) return right;
        else return left;
    }
}