zoukankan      html  css  js  c++  java
  • Construct Binary Tree from Inorder and Postorder Traversal

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

    Note:
    You may assume that duplicates do not exist in the 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>& inorder, int inorderStart,int inorderEnd,vector<int>& postorder,int postorderStart,int postorderEnd) {
            if(inorderEnd-inorderStart==1){
                return new TreeNode(inorder[inorderStart]);
            }
            if(inorderEnd-inorderStart==0){
                return 0;
            }
            int val = postorder[postorderEnd-1];
            int i=inorderStart;
            for(;i<inorderEnd;i++){
                if(inorder[i] == val){
                    break;
                }
            }
            TreeNode *root = new TreeNode(val);
            int leftLen = i-inorderStart;
            int rightLen = inorderEnd - i - 1;
            root->left = buildTree(inorder,inorderStart,inorderStart+leftLen,postorder,postorderStart,postorderStart+leftLen);
            root->right = buildTree(inorder,inorderStart+1+leftLen,inorderEnd,postorder,postorderStart+leftLen,postorderEnd-1);
            return root;
            
        }
        TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
            int postorederSize = postorder.size();
            int inorederSize = inorder.size();
            if(postorederSize != inorederSize){
                return NULL;
            }
            return buildTree(inorder,0,inorder.size(),postorder,0,postorder.size());
        }
    };
  • 相关阅读:
    [CF1039D]You Are Given a Tree
    [洛谷P2107]小Z的AK计划
    [CF409F]000001
    [洛谷P1801]黑匣子_NOI导刊2010提高(06)
    [洛谷P3377]【模板】左偏树(可并堆)
    [洛谷P2482][SDOI2010]猪国杀
    [CF45G]Prime Problem
    [CF735D]Taxes
    [洛谷P3413]SAC#1
    [洛谷P4124][CQOI2016]手机号码
  • 原文地址:https://www.cnblogs.com/zengzy/p/5008933.html
Copyright © 2011-2022 走看看