根据一棵树的前序遍历与中序遍历构造二叉树。
注意:
你可以假设树中没有重复的元素。
例如,给出
前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树:
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:
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
int size_pre = preorder.size(), size_in = inorder.size();
if(!(size_pre&&size_in) || size_pre != size_in)
return NULL;
return create(preorder, inorder, 0, size_pre-1, 0, size_in - 1);
}
TreeNode* create(vector<int>&pre, vector<int>&in, int p1, int p2, int in1, int in2){
if(p1 > p2)
return NULL;
int val = pre[p1];
TreeNode *temp = new TreeNode(val);
int index = in1;
for(; index <= in2; index++)
if(in[index] == val)
break;
//递归构造左子树和右子树
temp->left = create(pre, in, p1+1, p1+index-in1, in1, index-1);
temp->right = create(pre, in, p1+index-in1+1, p2, index+1, in2);
return temp;
}
};