(Leetcode)利用preorder-inorder/postorder-inorder构建二叉树

105. Construct Binary Tree from Preorder and Inorder Traversal

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

分析

根据preorder获得root节点(preorder第1个node)，通过root在inorder中的位置，得到左子树的长度，从而确定preorder中右子树的起始位置。

Code in Java

/**
 * 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[] preorder, int[] inorder) {
        return build(preorder,0, preorder.length-1, inorder, 0, inorder.length-1);
    }

    TreeNode build(int[] preorder, int prehead, int pretail, int[] inorder, int inhead, int intail){
        if(prehead>pretail||inhead>intail||prehead>=preorder.length) return null;
        TreeNode root = new TreeNode(preorder[prehead]);
        int root_Inorder = findIndex(inorder, preorder[prehead], inhead, intail);
        int right_Preorder;
        if(root_Inorder<intail){
            right_Preorder = (root_Inorder-inhead)+prehead+1;
        } 
        else{
            right_Preorder = pretail+1;
        }
        root.left = build(preorder, prehead+1, right_Preorder-1, inorder, inhead, root_Inorder-1);
        root.right = build(preorder, right_Preorder, pretail, inorder, root_Inorder+1, intail);
        return root;
    }

    //find ele's index in Array “num”
    int findIndex( int[] num, int ele, int head, int tail){
        for(int i=head; i<num.length&&i<=tail; i++){
            if(num[i]==ele) return i;
        }
        return -1;
    }
}

106. Construct Binary Tree from Inorder and Postorder Traversal

分析

同理，只不过这次是利用postorder的最后一个node来确定root的值，再通过inorder确定左子树和右子树的长度。

Code in java

/**
 * 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) {
        return build(postorder,0,postorder.length-1,inorder,0,inorder.length-1);
    }

    TreeNode build(int[] postorder, int posthead, int posttail, int[] inorder, int inhead, int intail){
        if(posthead>posttail||inhead>intail||posttail>=postorder.length) return null;
        TreeNode root = new TreeNode(postorder[posttail]);
        int root_Inorder = findIndex(inorder, root.val, inhead, intail);
        int right_Postorder;
        if(root_Inorder<intail){
            right_Postorder = (root_Inorder-inhead)+posthead;
        } 
        else{
            right_Postorder = posttail;
        }
        root.left = build(postorder, posthead, right_Postorder-1, inorder, inhead, root_Inorder-1);
        root.right = build(postorder, right_Postorder, posttail-1, inorder, root_Inorder+1, intail);
        return root;
    }

    //find ele's index in Array “num”
    int findIndex( int[] num, int ele, int head, int tail){
        for(int i=head; i<num.length&&i<=tail; i++){
            if(num[i]==ele) return i;
        }
        return -1;
    }
}