[leetcode-106]Construct Binary Tree from Inorder and Postorder Traversal(java)

最新推荐文章于 2022-08-15 06:17:44 发布

原创最新推荐文章于 2022-08-15 06:17:44 发布 · 557 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

leetcode

本文介绍了一种根据给定的中序和后序遍历序列构建二叉树的方法。通过分析，确定了根节点位置，并递归地构建左右子树。文章提供了一个实现该算法的示例代码。

问题描述：
Given inorder and postorder traversal of a tree, construct the binary tree.

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

分析：要构造一个生成树，必须要有一个中序遍历，还要有一个前序或者后序遍历（否则找不到左子树和右子树）。这里与先序遍历相同，也是先确定根节点的位置。然后再递归下去。

代码如下：364ms

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        int length = inorder.length;
        if(length<=0)
            return null;
        int rootVal = postorder[length-1];
        int point;
        for(point = 0;point<length;point++){
            if(inorder[point] == rootVal)
                break;
        }
        int[] leftInOrder = Arrays.copyOfRange(inorder,0,point);
        int[] rightInOrder = Arrays.copyOfRange(inorder,point+1,length);

        int[] leftPostOrder = Arrays.copyOfRange(postorder,0,point);
        int[] rightPostOrder = Arrays.copyOfRange(postorder,point,length-1);

        TreeNode root = new TreeNode(rootVal);
        root.left = buildTree(leftInOrder,leftPostOrder);
        root.right = buildTree(rightInOrder,rightPostOrder);

        return root;
    }
}