/**
* 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* head = NULL;
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(!root){
return NULL;
}
lowestCommonAncestorMeta(root,p,q);
return head;
}
int lowestCommonAncestorMeta(TreeNode* root, TreeNode* p, TreeNode* q) {
if(!root){
return 0;
}
if(root==p || root==q){
int ret = 1+lowestCommonAncestorMeta(root->left,p,q)+lowestCommonAncestorMeta(root->right,p,q);
if(ret==2&& head==NULL){
head = root;
}
return ret;
}else{
int ret = lowestCommonAncestorMeta(root->left,p,q)+lowestCommonAncestorMeta(root->right,p,q);
if(ret==2 && head==NULL){
head = root;
}
return ret;
}
return 0;
}
};