Week 6 Construct Binary Tree from Preorder and Inorder Traversal

105. Construct Binary Tree from Preorder and Inorder Traversal

问题概述

Given preorder and inorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
For example, given
preorder = [3,9,20,15,7]
inorder = [9,3,15,20,7]

Return the following binary tree:

分析

Preorder 先序遍历，先处理根节点，然后处理左子树，再处理右子树
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) {
        reverse(preorder.begin(), preorder.end());
        return buildTree(preorder, inorder, 0, inorder.size() - 1);
    }
private:
    TreeNode* buildTree(vector<int> &preorder, const vector<int> &inorder, int first, int last)
    {
        if (preorder.empty() || first > last)
        {
            return nullptr;
        }
        
        auto val = preorder.back();
        preorder.pop_back();
        auto node = new TreeNode(val);
        
        auto itr = find(inorder.begin() + first, inorder.begin() + last + 1, val);
        node->left = buildTree(preorder, inorder, first, itr - inorder.begin() - 1);
        node->right = buildTree(preorder, inorder, itr - inorder.begin() + 1, last);
        return node;
    }

};