重建二叉树(前序中序,后序中序)
根据前序和中序构建二叉树:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int index=0;
TreeNode* rebuild(vector<int> pre,vector<int> vin, int left, int right)
{
if(left==right || pre.size()==index)
{
return nullptr;
}
TreeNode *head=NULL;
for(int i=left;i<right; i++)
{
if(pre[index]==vin[i])//查找分界点
{
head=new TreeNode(pre[index]);
index++;
head->left=rebuild(pre, vin, left, i