描述
给出先序和中序,重构二叉树
解决
递归,利用先序找根节点,再把中序分为左右子树,递归解决
/**
* 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) {
TreeNode *root = NULL;
int pre_length = preorder.size(), in_length = inorder.size();
int st_pre = 0, st_in = 0;
root = help(preorder, st_pre, pre_length, inorder, st_in, in_length);
return root;
}
TreeNode *help(vector<int> &preorder, int st_pre, int ed_pre, vector<int> &inorder, int st_in, int ed_in)
{
if (st_pre >= ed_pre || st_in >= ed_in)
return NULL;
TreeNode *root = new TreeNode(preorder[st_pre]);
int zz = 0;
for (int i = st_in; i < ed_in; ++i)
{
if (preorder[st_pre] == inorder[i])
zz = i;
}
root -> left = help(preorder, st_pre + 1, st_pre + 1 + zz - st_in, inorder, st_in, zz);
root -> right = help(preorder, st_pre + 1 + zz - st_in, ed_pre, inorder, zz + 1, ed_in);
return root;
}
};