LeetCode-106：Construct Binary Tree from Inorder and Postorder Traversal (利用中序和后序遍历构建二叉树) -- medium

Question

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

Note:

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

问题解析：

给定一棵树的中序和后序遍历数组，构建该二叉树。

Answer

Solution 1：

数据结构，递归调用。

• 利用基本二叉树的遍历关系，以递归的方式自顶向下，自左向右构建二叉树。
• 利用后序遍历的最后一个元素为子树的根结点，该根结点在中序遍历的位置为左右子树的分割点。
• 需要注意左右子树的边界。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        if (inorder == null || postorder == null || inorder.length != postorder.length)
            return null;
        HashMap<Integer, Integer> hm = new HashMap<Integer, Integer>();
        for (int i = 0; i< inorder.length; ++i){
            hm.put(inorder[i], i);
        }

        return buildChildTree(inorder, 0, inorder.length-1, postorder, 0, postorder.length-1, hm);
    }

    private TreeNode buildChildTree(int[] inorder, int is, int ie, int[] postorder, int ps, int pe, HashMap<Integer, Integer> hm){
        if (ps > pe || is > ie) return null;
        TreeNode root = new TreeNode(postorder[pe]);
        int ri = hm.get(postorder[pe]);
        TreeNode leftchild = buildChildTree(inorder, is, ri-1, postorder, ps, ps+ri-is-1, hm);
        TreeNode rightchild = buildChildTree(inorder, ri+1, ie, postorder, ps+ri-is, pe-1, hm);
        root.left = leftchild;
        root.right = rightchild;
        return root;
    }
}

• 时间复杂度：O(lgn)，空间复杂度：O(n)

Solution 2：

python 解法，更加简洁。

• 以postorder一直保存的是子树的根结点，所以取根结点直接pop，先建立右子树，再建立左子树。
• 更加清晰简洁。

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def buildTree(self, inorder, postorder):
        """
        :type inorder: List[int]
        :type postorder: List[int]
        :rtype: TreeNode
        """
        if not inorder or not postorder:
            return None

        root = TreeNode(postorder.pop())
        inorderIndex = inorder.index(root.val)

        root.right = self.buildTree(inorder[inorderIndex+1:], postorder)
        root.left = self.buildTree(inorder[:inorderIndex], postorder)

        return root