Construct Binary Tree from Preorder and Inorder Traversal
/**
* 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* build(int *pre, int *in, int n) {
if (n <= 0) {
return NULL;
}
TreeNode *r = new TreeNode(pre[0]);
int p = 0;
while (p < n && in[p] != pre[0]) {
++p;
}
if (p > n) {
//error
return r;
}
r->left = build(pre + 1, in, p);
r->right = build(pre + 1 + p, in + 1 + p, n - p - 1);
}
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
if (preorder.size() != inorder.size() || preorder.empty()) {
return NULL;
}
return build(&preorder[0], &inorder[0], preorder.size());
}
};