LeetCode -- 查找最小公共祖先

标签：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
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;  
    else if(left != NULL)  
        return left;  
    else if (right != NULL)  
        return right;  
    else   
        return NULL;  
    }
};

LeetCode -- 查找最小公共祖先

标签：

原文地址：http://blog.csdn.net/lan_liang/article/details/47421007