Code
递归的去遍历左右子树是否包含要查找的节点
/**
* 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 || p == root || q == root) return root;
TreeNode* L = lowestCommonAncestor(root->left,p,q);
TreeNode* R = lowestCommonAncestor(root->right,p,q);
if(L == NULL){
return R;
}
else if(R == NULL){
return L;
}else{
return root;
}
}
};