LeetCode#106. Construct Binary Tree from Inorder and Postorder Traversal

106. Construct Binary Tree from Inorder and Postorder Traversal

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

c++代码1：

/**
 * 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* createTree(vector<int>& inorder, vector<int>& postorder,int inL,int inR,int postL,int postR){
        //inL:中序遍历左边界 inR:中序遍历右边界
        //postL:后序遍历左边界 postR:后序遍历右边界
        if(inL>inR)return NULL;
        TreeNode *root=new TreeNode(postorder[postR]);//新建树节点 树节点值为postorder[postR]
        int inPos;
        for(inPos=inL;inPos<=inR;++inPos){//找出中序遍历序列中当前根节点的位置
            if(postorder[postR]==inorder[inPos])break;
        }
        int leftTreeNodeCount=inPos-inL;//当前根节点左子树上的结点个数
        //左子树的中序区间[inL,inPos-1],后序区间为[postL,postL+leftTreeNodeCount-1]
        //返回左子树根节点指针给root->left
        root->left=createTree(inorder,postorder,inL,inPos-1,postL,postL+leftTreeNodeCount-1);
        //右子树的中序区间[inPos+1,inR],后序区间为[postL+leftTreeNodeCount,preR-1]
        //返回右子树根节点指针给root->right
        root->right=createTree(inorder,postorder,inPos+1,inR,postL+leftTreeNodeCount,postR-1);
        return root;
    }
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        return createTree(inorder,postorder,0,inorder.size()-1,0,postorder.size()-1);
    }
};