#73 Construct Binary Tree from Preorder and Inorder Traversal

最新推荐文章于 2021-07-06 08:51:48 发布

易月

最新推荐文章于 2021-07-06 08:51:48 发布

阅读量312

点赞数

分类专栏： lintcode 文章标签： lintcode binary tree tree traversal

本文链接：https://blog.csdn.net/haifischxia/article/details/52343470

版权

lintcode 专栏收录该内容

217 篇文章 0 订阅

订阅专栏

题目描述：

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

Notice

You may assume that duplicates do not exist in the tree.

Have you met this question in a real interview?

Yes

Example

Given in-order [1,2,3] and pre-order [2,1,3], return a tree:

  2
 / \
1   3

题目思路：

这题可以观察到，preorder的第一个数决定了root是谁，而root所在的inorder的位置，决定了它左边是左子树，右边是右子树。那么这样就好办了：用recursion去构成每棵树的节点：preorder[pstart]永远是root，然后在inorder中寻找preorder[pstart]这个值的位置，找到位置以后，向左是构成左子树的数组，向右是构成右子树的数组。

Mycode（AC = 11ms）：

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
 

class Solution {
    /**
     *@param preorder : A list of integers that preorder traversal of a tree
     *@param inorder : A list of integers that inorder traversal of a tree
     *@return : Root of a tree
     */
public:
    TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) {
        // write your code here
        if (preorder.size() == 0 || inorder.size() == 0) {
            return NULL;
        }
        
        return buildTree(preorder, 0, preorder.size() - 1, 
                         inorder, 0, inorder.size() - 1);
    }
    
    TreeNode *buildTree(vector<int> &preorder,
                        int pstart,
                        int pend,
                        vector<int> &inorder,
                        int istart,
                        int iend)
    {
        if (pstart > pend || istart > iend) {
            return NULL;
        }
        
        if (pstart == pend) {
            return new TreeNode(preorder[pstart]);
        }
        
        // use the head of preorder to decide the root
        TreeNode *root = new TreeNode(preorder[pstart]);
        int idx = -1;
        for (int i = istart; i <= iend; i++) {
            if (inorder[i] == preorder[pstart]) {
                idx = i;
                break;
            }
        }
        
        // use inorder to decide left tree and right tree
        int left_len = idx - istart, right_len = iend - istart - left_len;
        root->left = buildTree(preorder, pstart + 1, pstart + left_len, 
                               inorder, istart, idx - 1);
        root->right = buildTree(preorder, pstart + left_len + 1, pend, 
                                inorder, idx + 1, iend);
        
        return root;
    }
};

）