Given preorder and inorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
Code:
<span style="font-size:14px;">/**
* 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 *helper(const vector<int> &preorder, const vector<int> &inorder, int preBegin, int preEnd, int inBegin, int inEnd) {
if (inBegin > inEnd) return NULL;
TreeNode *root = new TreeNode(preorder[preBegin]);
int index = inBegin;
for (; index <= inEnd; ++index)
if (inorder[index] == preorder[preBegin]) break;
root->left = helper(preorder, inorder, preBegin+1, preBegin+index-inBegin,inBegin, index-1);
root->right = helper(preorder, inorder, preBegin+index-inBegin+1, preEnd, index+1, inEnd);
return root;
}
TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) {
return helper(preorder, inorder, 0, preorder.size()-1, 0, inorder.size()-1);
}
};</span>