Leetcode no. 105

105. Construct Binary Tree from Preorder and Inorder Traversal

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

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

/**
 * 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) {
        if (preorder.length==0 || inorder.length==0) return null;
        return buildTree(preorder, inorder, 0, 0, preorder.length-1);
    }
    public TreeNode buildTree(int[] preorder, int[] inorder, int preleft, int inleft, int inright){
        if (preleft>preorder.length-1 || inleft>inright) return null;
        int index=0;
        TreeNode node= new TreeNode(preorder[preleft]);
        for (int i = inleft; i <= inright; i++) {
            if (inorder[i]==node.val){
                index=i;
                break;
            }
        }
        node.left=buildTree(preorder, inorder, preleft+1, inleft, index-1);
        node.right= buildTree(preorder, inorder, preleft+index-inleft+1, index+1, inright);
        return node;
    }
}