剑指offer面试题7——重建二叉树

题目描述

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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) {
        int length = vin.size();
        if(length == 0)
            return NULL;
        TreeNode* root = new TreeNode(pre[0]);
        vector<int> leftPre, rightPre, leftVin, rightVin;
        
        //在中序遍历序列中找到根节点
        //int i = 0;
        int rootInorder = 0;
        for(int i=0; i<length; i++){
            if(pre[0] == vin[i]){
                rootInorder = i;
                break;
            }
        }
        
        for(int i=0; i<rootInorder; i++){
            leftVin.push_back(vin[i]);
            leftPre.push_back(pre[i+1]);
        }
        for(int i=rootInorder+1; i<length; i++){
            rightPre.push_back(pre[i]);
            rightVin.push_back(vin[i]);
        }
        
        //构建左子树
        root->left = reConstructBinaryTree(leftPre, leftVin);
        //构建右子树
        root->right = reConstructBinaryTree(rightPre, rightVin);
        
        return root;
    }
};