[LEETCODE]106. 从中序与后序遍历序列构造二叉树

LEETCODE105：从前序与中序遍历序列构造二叉树
1.题目：
根据一棵树的中序遍历与后序遍历构造二叉树。
注意:
你可以假设树中没有重复的元素。

例如，给出
中序遍历 inorder = [9,3,15,20,7]
后序遍历 postorder = [9,15,7,20,3]
返回如下的二叉树：
    3
   / \
  9  20
    /  \
   15   7

2.代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
/*
思路同LEETCODE105
postroder:  [left,right,root]
inorder:	[left,root,right];
*/
typedef struct TreeNode* Tree;

Tree getTree(int* postorder,int post_start,int post_end,int *inorder,int in_start,int in_end){
    if(post_start>post_end||in_start>in_end)
        return NULL;
    int i=in_start;
    while(inorder[i]!=postorder[post_end]&&i<=in_end)
        i++;
    int len_left=i-in_start;
    Tree left=getTree(postorder,post_start,post_start+len_left-1,inorder,in_start,in_start+len_left-1);
    Tree right=getTree(postorder,post_start+len_left,post_end-1,inorder,i+1,in_end);  
    Tree root=malloc(sizeof(struct TreeNode));
    root->val=postorder[post_end];
    root->left=left;
    root->right=right;
    return root;
}

struct TreeNode* buildTree(int* inorder, int inorderSize, int* postorder, int postorderSize){
    Tree r=getTree(postorder,0,postorderSize-1,inorder,0,inorderSize-1);
    return r;
}

3.知识点：

递归