输入一棵二叉树前序遍历和中序遍历的结果,请重建该二叉树。
注意:
二叉树中每个节点的值都互不相同;
输入的前序遍历和中序遍历一定合法;
样例
给定:
前序遍历是:[3, 9, 20, 15, 7]
中序遍历是:[9, 3, 15, 20, 7]
返回:[3, 9, 20, null, null, 15, 7, null, null, null, null]
返回的二叉树如下所示:
3
/
9 20
/
15 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:
map<int, int> hash;
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
int n = inorder.size();
for(int i=0; i<n; i++) {
hash[inorder[i]] = i;
}
return bfs(preorder, 0, n-1, inorder, 0, n-1);
}
TreeNode* bfs(vector<int> preorder, int pl, int pr, vector<int> inorder, int il, int ir) {
if(pl>pr) return NULL;
auto root = new TreeNode(preorder[pl]);
int k = hash[root->val];
auto left = bfs(preorder, pl+1, pl+k-il, inorder, il, k-1);
auto right = bfs(preorder, pl+k+1-il, pr, inorder, k+1, ir);
root->left = left, root->right = right;
return root;
}
};