Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal

Question

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

Code

  public TreeNode get(int[] preorder, int[] inorder, int i, int ileft, int iright) {
        if (ileft > iright) {
            return null;
        }
        int t = ileft;
        for (t = ileft; t <= iright && inorder[t] != preorder[i]; t++) ;
        TreeNode root = new TreeNode(preorder[i]);
        root.left = get(preorder, inorder, i + 1, ileft, t - 1);
        root.right = get(preorder, inorder, t - ileft + i + 1, t + 1, iright);
        return root;
    }

    public TreeNode buildTree(int[] preorder, int[] inorder) {

        if (preorder.length != inorder.length || preorder.length < 1) {
            return null;
        }
        return get(preorder, inorder, 0, 0, inorder.length - 1);
    }