LeetCode: Construct Binary Tree from Inorder and Postorder Traversal [106]

【题目】

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

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

【题意】

    给定中序遍历和后序遍历，构造二叉树

【思路】

    思路跟Construct Binary Tree from Preorder and Inorder Traversal相同， 只不过是前序换成了后序，前序的构成是：根值+左子树先序+右子树先序；而后序的构成是：左子树后序+右子树后序+根值。

【代码】

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:

    int getPosOfRoot(vector<int> &inorder, int istart, int iend, int key){
        for(int i=istart; i<=iend; i++){
            if(inorder[i]==key)return i;
        }
    }

    TreeNode *build(vector<int> &inorder, int istart, int iend, vector<int>&postorder, int pstart, int pend){
        if(istart>iend)return NULL;
        //创建根节点
        TreeNode*root = (TreeNode*)malloc(sizeof(TreeNode));
        root->val=postorder[pend];
        
        //确定根值在中序遍历中的位置
        int rootPos = getPosOfRoot(inorder, istart, iend, postorder[pend]);
        //左子树的序列长度
        int lenLeft = rootPos-istart;
        //右子树的序列长度
        int lenRight = iend-rootPos;
        //构造左子树
        TreeNode*left = build(inorder, istart, rootPos-1, postorder, pstart, pstart+lenLeft-1);
        //构造右子树
        TreeNode*right = build(inorder, rootPos+1, iend, postorder, pstart+lenLeft, pend-1);
        
        //构造二叉树
        root->left=left;
        root->right=right;
        
        return root;
    }

    TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder) {
        int size=inorder.size();
        if(size==0)return NULL;
        
        return build(inorder, 0, size-1, postorder, 0, size-1);
    }
};