Construct Tree from given Postorder and Inorder Traversals in Java

import java.util.*;

class Node {
    int data;
    Node left, right;

    Node(int value) {
        data = value;
        left = right = null;
    }
}

public class ConstructTreePostIn {

    static int postIndex;

    public static Node buildTree(int[] inorder, int[] postorder, int start, int end) {

        if (start > end)
            return null;

        // Pick root from postorder
        int rootValue = postorder[postIndex--];
        Node root = new Node(rootValue);

        // If leaf node
        if (start == end)
            return root;

        // Find root index in inorder
        int inIndex = search(inorder, start, end, rootValue);

        // Build right subtree first
        root.right = buildTree(inorder, postorder, inIndex + 1, end);
        root.left = buildTree(inorder, postorder, start, inIndex - 1);

        return root;
    }

    public static int search(int[] inorder, int start, int end, int value) {
        for (int i = start; i <= end; i++) {
            if (inorder[i] == value)
                return i;
        }
        return -1;
    }

    // Inorder traversal for verification
    public static void inorderPrint(Node root) {
        if (root == null) return;

        inorderPrint(root.left);
        System.out.print(root.data + " ");
        inorderPrint(root.right);
    }

    public static void main(String[] args) {

        int[] inorder = {4, 2, 5, 1, 3, 6};
        int[] postorder = {4, 5, 2, 6, 3, 1};

        postIndex = postorder.length - 1;

        Node root = buildTree(inorder, postorder, 0, inorder.length - 1);

        System.out.print("Constructed Tree (Inorder): ");
        inorderPrint(root);
    }
}