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.

Subscribe to see which companies asked this question

/**
 * 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 == null || inorder == null || preorder.length == 0 || inorder.length == 0)
            return null;
        return buildTreeHelper(preorder, 0, preorder.length - 1, inorder, 0, inorder.length - 1);
    }
    
    private TreeNode buildTreeHelper(int[] preorder, int beginIndex1, int endIndex1, int[] inorder, int beginIndex2, int endIndex2){
        if(beginIndex1 == endIndex1)
            return new TreeNode(preorder[beginIndex1]);
        if(beginIndex1 > endIndex1)
            return null;
        int rootVal = preorder[beginIndex1];
        int i = beginIndex2;
        while(i <= endIndex2 && inorder[i] != rootVal)
            i++;
        TreeNode root = new TreeNode(rootVal);
        int leftTreeLength = i - beginIndex2;
        root.left = buildTreeHelper(preorder, beginIndex1+1, beginIndex1 + leftTreeLength, inorder, beginIndex2, i-1);
        root.right = buildTreeHelper(preorder, beginIndex1 + leftTreeLength + 1, endIndex1, inorder, leftTreeLength + 1 + beginIndex2, endIndex2);
        return root;
    }
}