与树相关的题大部分会用到dfs
/**
* 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:
void dfs(TreeNode* root,TreeNode* target, vector<TreeNode*> &ancestorList, int *flag)
{
if(!root) return;
if(root==target)
{
ancestorList.push_back(target);
*flag=1;
return;
}
ancestorList.push_back(root);
dfs(root->left,target,ancestorList,flag);
if(*flag==1) return;
dfs(root->right,target,ancestorList,flag);
if(*flag==1) return;
ancestorList.pop_back();
}
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
vector<TreeNode*> r1,r2;
int flag=0;
dfs(root,p,r1,&flag);
flag=0;
dfs(root,q,r2,&flag);
int p1=0;
while(p1<r1.size()&&p1<r2.size()&&r1[p1]==r2[p1])
p1++;
return r1[p1-1];
}
};