输入一棵二叉树前序遍历和中序遍历的结果,请重建该二叉树。
注意:
- 二叉树中每个节点的值都互不相同;
- 输入的前序遍历和中序遍历一定合法;
样例
给定:
前序遍历是:[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
代码:
class Solution {
public:
map<int,int> loc;
TreeNode* dfs(vector<int>& pre, vector<int>& in, int pstart, int pend, int istart, int iend){
if(pstart > pend)
return NULL;
//k表示左子树节点的数目
int k = loc[pre[pstart]] - istart;
//建立根节点
TreeNode* root = new TreeNode(pre[pstart]);
root->left = dfs(pre,in,pstart+1,pstart+k,istart,istart+k-1);
root->right = dfs(pre,in,pstart+k+1,pend,istart+k+1,iend);
}
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
int size = preorder.size();
for(int i = 0; i < size; i ++)
loc[inorder[i]] = i;
return dfs(preorder,inorder,0,size-1,0,size-1);
}
};