【Leetcode】之Construct Binary Tree from Preorder and Inorder Traversal

一.问题描述

Given preorder and inorder traversal of a tree, construct the binary tree.

二.我的解题思路

给定二叉树的前序遍历序列和中序遍历序列，要求重建二叉树。

这道题可以采用递归的算法思想，每次将序列切分成左子树序列和右子树序列，然后递归生成即可。测试通过的程序如下：

/**
 * 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) {
        int len = preorder.size();
        if(len == 0) return NULL;
        TreeNode* root = new TreeNode(preorder[0]);
        vector<int>::iterator root_idx = find(inorder.begin(), inorder.end(), preorder[0]);
        int idx = root_idx - inorder.begin();
        root->left = gen_tree(preorder, 1, idx, inorder, 0, idx-1);
        root->right = gen_tree(preorder, idx+1, preorder.size()-1, inorder, idx+1, inorder.size()-1);
        return root;
    }
    
    TreeNode* gen_tree(vector<int>& preorder,int pre_st, int pre_end, vector<int>& inorder, int in_st, int in_end)
    {
        int len = pre_end - pre_st;
        if(len < 0) return NULL;
        TreeNode* root = new TreeNode(preorder[pre_st]);
        vector<int>::iterator root_idx = find(inorder.begin()+in_st, inorder.begin()+in_end, preorder[pre_st]);
        int num = root_idx-(inorder.begin()+in_st);
        root->left = gen_tree(preorder, pre_st+1, pre_st+num, inorder, in_st, in_st+num-1);
        root->right = gen_tree(preorder, pre_st+num+1, pre_end, inorder, in_st+num+1, in_end);
        return root;
    }
    
};