最近公共祖先

//代码如下
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 && right)
            return root;
        if(!left && !right) //这一句实际上和下一句可以合成为一句
            return NULL;
        return left ? left : right;
    }
};