题目描述:
输入某二叉树的前序遍历和中序遍历的结果,请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
例如,给出
前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树:
/**
* 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* buildTree(vector<int>& preorder, vector<int>& inorder) {
if(preorder.size() == 0) return NULL;
TreeNode* root = new TreeNode(preorder[0]);
stack<TreeNode*> s;
int inorderIndex = 0;
s.push(root);
for(int i = 1 ; i < preorder.size() ; ++i){
int preval = preorder[i];
TreeNode* node = s.top();
if(node->val != inorder[inorderIndex]){
node->left = new TreeNode(preorder[i]);
s.push(node->left);
}
else{
while(!s.empty() && s.top()->val == inorder[inorderIndex]){
node = s.top();
s.pop();
inorderIndex++;
}
node->right = new TreeNode(preval);
s.push(node->right);
}
}
return root;
}
};
上述代码非原创,如有侵权,请联系删除。