这里代码需要注意的地方有:
使用NEW来建立根节点。
TreeNode* root= new TreeNode(pre[0]);
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
if(pre.size()==0)return NULL;
TreeNode* root= new TreeNode(pre[0]);
int i=0;
for(;i<vin.size();i++){
if(pre[0]==vin[i])break;
}
vector<int> lowin(vin.begin(),vin.begin()+i);
vector<int> highin(vin.begin()+1+i,vin.end());
vector<int> lowpre(pre.begin()+1,pre.begin()+1+lowin.size());
vector<int> highpre(pre.begin()+1+lowin.size(),pre.end());
root->left=reConstructBinaryTree(lowpre,lowin);
root->right=reConstructBinaryTree(highpre,highin);
return root;
}
};
/*
struct TreeLinkNode {
int val;
struct TreeLinkNode *left;
struct TreeLinkNode *right;
struct TreeLinkNode *next;
TreeLinkNode(int x) :val(x), left(NULL), right(NULL), next(NULL) {
}
};
*/
class Solution {
public:
TreeLinkNode* GetNext(TreeLinkNode* pNode) {
if (pNode == NULL)
return NULL;
TreeLinkNode* pret = pNode;
if (pNode->right){
pret = pNode->right;
while(pret->left){
pret = pret->left;
}
return pret;
}
while(pNode->next){
pret = pNode->next;
if(pret->left == pNode)
return pret;
pNode = pNode->next;
}
return NULL;
}
};
这部分的判断看图
while(pNode->next){
pret = pNode->next;
if(pret->left == pNode)
return pret;
pNode = pNode->next;
}
return NULL;