Construct Binary Tree from Inorder and Postorder Traversal

最新推荐文章于 2024-09-21 10:02:17 发布

fullstack_lth

最新推荐文章于 2024-09-21 10:02:17 发布

阅读量216

点赞数

分类专栏： LeetCode 文章标签： C++ leetcode

本文链接：https://blog.csdn.net/u014744118/article/details/52384095

版权

LeetCode 专栏收录该内容

161 篇文章 0 订阅

订阅专栏

一、问题描述

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

二、思路

和Construct Binary Tree from Preorder and Inorder Traversal思路基本一致，主要是根据在中序遍历中找到当前的值，然后通过对应关系递归。

三、代码

/**
 * 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>& inorder, vector<int>& postorder) {
        return creatTree(0, inorder.size() - 1, 0, postorder.size() - 1, inorder, postorder);
    }
    TreeNode*creatTree(int in_begin, int in_end, int post_begin,int post_end, vector<int> &inorder, vector<int> &postorder){
        if(post_begin > post_end)    return NULL;
        TreeNode* root = new TreeNode(postorder[post_end]);
        int index = 0;
        for(int i = in_end; i >= 0; --i){
            if(inorder[i] == root -> val){
                index = i;
                break;
            }
        }
        root -> right = creatTree(index + 1, in_end, post_begin + index - in_begin, post_end - 1, inorder, postorder);
        root -> left = creatTree(in_begin, index - 1, post_begin, post_begin + index - in_begin - 1, inorder, postorder);
        return root;
    }
};