Leetcode105. 从前序与中序遍历序列构造二叉树

描述

根据一棵树的前序遍历与中序遍历构造二叉树。

注意:
你可以假设树中没有重复的元素。

例如，给出

前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树：

   3
  / \
 9   20
     /  \
     15   7

/**
 * 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) {
        /**
 * 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) {
       if(preorder.size()==0)
            return nullptr;
        int i=0;
        
        //在中序遍历中找到根节点
        for(;i<inorder.size();++i)
        {
            if(inorder[i]==preorder[0])
                break;
        }
        
        TreeNode* root=new TreeNode(preorder[0]);
        
        //切割左右子树
        vector<int> preLeft(preorder.begin()+1,preorder.begin()+i+1);
        vector<int> preRight(preorder.begin()+i+1,preorder.end());
        
        vector<int> inLeft(inorder.begin(),inorder.begin()+i);
        vector<int> inRight(inorder.begin()+i+1,inorder.end());
       
        //递归构造
        root->left=buildTree(preLeft,inLeft);
        root->right=buildTree(preRight,inRight);
        return root;
    }
};