LeetCode-Construct Binary Tree from Inorder and Postorder Traversal

作者：disappearedgod

文章出处：http://blog.csdn.net/disappearedgod/article/details/39026047

时间：2014-4-16

题目

Construct Binary Tree from Inorder and Postorder Traversal

  Total Accepted: 13912  Total Submissions: 52633 My Submissions

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

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

Have you been asked this question in an interview?

思想

例子

     1

    / \

   2   3

  /\     \

4  5    6

index       :    0    1    2    3    4    5    

inorder    :    4    2    5    1    3    6   

postorder:    4    5    2    6    3    1   

 

题意：根据中根遍历结果与后根遍历结果求出原来的树

分析：1.如何根据树得中根与后根求树，简单说明一下：

（1）后根遍历的最后一个节点是该树的根；

（2）在中根遍历中找到该节点，下标记为index，该节点将树左右分开

（3）后根遍历中［0,index-1]就是左子树的节点，[index,lenth-1]就是右子树的节点

（4）分别对左子树和右子树进行递归求解

解法

递归

代码

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        return buildTree(inorder, 0, inorder.length-1, postorder, 0, postorder.length-1);
    }
    public TreeNode buildTree(int[] inorder,int l, int h, int[] postorder, int lo, int hi) {
        if(l > h || lo > hi)
            return null;
        TreeNode t = new TreeNode(postorder[hi]);
        int index = 0;
        for(int i = l ; i < h; i++)
            if(inorder[i] == postorder[hi]){
                index = i;
            }
        if(index != lo)
            t.left = buildTree(inorder, l, index-1, postorder, lo, index-1);
        if(index != h)
            t.right = buildTree(inorder, index + 1, h, postorder, index, hi-1);
        return t;
    }
}

结果

Submission Result: Time Limit Exceeded

Last executed input:

[-80,25,98,13,16,79,-59,-49,-50,-83,6,-96,85,-36,77,20,55,23,92,72,-58,-6,14,-76,-46,41,-37,17,64,88,-73,-85,-52,30,75,19,-42,-55,87,80,59,-27,-81,1,44,-14,84,-10,-60,-34,91,-87,31,42,5,-18,38,86,-25,74,22,-7,-90,56,-72,32,-24,50,-13,-71,83,60,34,-20,49,58,53,-4,-89,78,27,-21,-16,-54,67,-1,21,11,-22,81,40,-92,-29,89,-95,-48,47,-23,-3,-19,61,-99,4,48,-63,-79,-30,-100,54,-70,94,39,-9,-41,-82,15,-98,-15,-97,-43,-64,43,97,51,82,68,96,-5,36,28,35,-69,65,24,-74,57,66,-94,-88,18,37,0,29,9,76,-61,33,69,-39,3,-44,90,-65,95,-26,2,93,-78,-84,-17,-12,-66,-75,-40,99,73,-57,7,26,-68,8,12,-8,62,46,-51,-67,-47,-2,52,-77,-86,10,-38,-93,-35,45,-31,-91,63,71,-28,-53,-56,-32,-33,-45,70,-62,-11], [-80,98,25,13,79,-49,-59,6,-83,-96,-36,85,-50,20,23,92,55,72,-6,-76,14,41,64,17,-73,-85,30,-52,75,88,-37,87,59,-27,80,1,-81,-55,44,-42,-14,19,-46,-60,-34,-87,31,91,-10,-18,38,-25,74,86,5,42,-90,-7,22,-72,32,56,50,-71,-13,-24,60,-20,34,58,-4,78,-16,-21,-54,27,-89,53,49,83,-1,21,81,40,-29,89,-92,-22,11,47,-23,-19,-3,-48,-99,61,-95,48,-79,-100,54,-70,39,-9,-82,-41,94,-30,15,-63,-15,-97,43,97,-64,51,-43,-98,4,67,84,82,-58,77,16,96,36,35,-69,65,28,-5,-74,57,18,-88,0,37,-94,66,24,9,-61,76,29,3,-39,90,-65,-44,2,-26,95,69,-17,-84,-78,93,-66,-40,99,-57,-68,26,7,73,46,62,-8,12,-47,-67,-2,-51,-86,10,45,-35,-93,-38,-31,-77,63,71,-91,-28,-56,-33,-32,70,-11,-62,-45,-53,52,8,-75,-12,33,68]

---

非递归

代码

结果

返回