题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
思路:由前序遍历找到根节点,带到中序遍历中找到相应的位置,该位置之前为根节点的左子树,之后为根节点的右子树,遍历
/**
* 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* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
if (pre.empty() || vin.empty()) return nullptr;
return Construct(pre, 0, pre.size()-1, vin, 0, vin.size()-1);
}
TreeNode* Construct(vector<int> pre, int pstart, int pend, vector<int> vin, int vstart, int vend) {
if (pstart > pend || vstart > vend) return nullptr;
TreeNode* root = new TreeNode(pre[pstart]);
int vlen = vstart;//存储左子树的长度
for (int i = vstart; i <= vend; ++i)
if (vin[i] == root->val){
vlen = i;
break;
}
int pOrder = vlen - vstart + pstart;
if (vlen > vstart)
root->left = Construct(pre, pstart + 1, pOrder, vin, vstart, vlen-1);
if (vlen < vend)
root->right = Construct(pre, pOrder+1, pend, vin, vlen+1, vend);
return root;
}
};