Construct Binary Tree from Preorder and Inorder Traversal in Java

Construct Binary Tree from Preorder and Inorder Traversal is a good example of turning a small-looking problem into a precise invariant. The Java implementation below captures the core idea, so this post focuses on why the approach works, what it is really solving, and how to debug it when the first attempt goes wrong.

---

Problem 1: Construct Binary Tree from Preorder and Inorder Traversal

Problem description: We are given a problem around Construct Binary Tree from Preorder and Inorder Traversal and need a Java solution that is correct on both normal and edge-case inputs. The challenge is usually not writing a loop or recursion call; it is preserving the one invariant that makes the approach valid from start to finish.

What we are solving actually: We are solving for correctness under the constraints that matter for this problem family. In practice, that means understanding which state must be remembered, what can be derived on the fly, and where a brute-force approach would waste work or break boundary conditions.

What we are doing actually:

1. treat each node as the root of a smaller subproblem
2. compute or collect what the parent needs from the children
3. use hash-based lookup and recursion or subtree decomposition so subtree work composes cleanly
4. handle null nodes as an explicit base case instead of an afterthought

Why This Problem Matters

• tree problems get easier when each subtree is treated as a complete subproblem with a return contract
• recursion depth, traversal order, and null handling decide correctness more than syntax does
• construct binary tree from preorder and inorder traversal is a strong example of thinking from node contract to whole-tree answer

Implementation Context

This post is built around a Java implementation of the problem and keeps the solution shape close to the version I wanted to teach from. The goal is to preserve the underlying idea while making the reasoning easier to follow.

That keeps the article practical. Instead of presenting an overly polished answer detached from how these problems are usually solved, the explanation stays close to interview-style Java code and makes the invariants explicit.

Java Solution

import java.util.HashMap;
import java.util.Map;

/**
 * 105. Construct Binary Tree from Preorder and Inorder Traversal
 * <p>
 * Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder
 * is the inorder traversal of the same tree, construct and return the binary tree.
 */
class TreeNode {
	int val;
	TreeNode left;
	TreeNode right;

	TreeNode(int val) {
		this.val = val;
	}

	TreeNode(int val, TreeNode left, TreeNode right) {
		this.val = val;
		this.left = left;
		this.right = right;
	}
}

public class BinaryTreeFromPreorderAndInorderTraversal {
	int preOrderIndex;
	//to store element as key and its index as value
	Map<Integer, Integer> inOrderIndexMap = new HashMap<>();

	public TreeNode buildTree(int[] preorder, int[] inorder) {
		preOrderIndex = 0;

		for (int i = 0; i < inorder.length; i++) {
			inOrderIndexMap.put(inorder[i], i);
		}
		return buildTree(preorder, 0, inorder.length - 1);
	}

	private TreeNode buildTree(int[] preorder, int left, int right) {
		if (left > right)
			return null;

		int rootValue = preorder[preOrderIndex++];
		TreeNode root = new TreeNode(rootValue);

		// Preorder NLR moving from left to right so left tree first then right tree
		//left array from => 0 to ROOT_INDEX-1
		root.left = buildTree(preorder, left, inOrderIndexMap.get(rootValue) - 1);
		//right array from => ROOT_INDEX+1 to right
		root.right = buildTree(preorder, inOrderIndexMap.get(rootValue) + 1, right);
		return root;
	}
}

Why This Solution Works

The implementation works because it keeps the critical state small and meaningful. Instead of trying to remember every past possibility, it keeps only the information needed for the next step, and that is exactly what makes the solution easier to reason about than a brute-force version.

Another good thing to notice is that the code is direct. The data structure and control flow match the problem shape closely, which is what you want in DSA code: fewer moving parts, cleaner invariants, and a faster path to debugging.

Dry Run

Dry-run Construct Binary Tree from Preorder and Inorder Traversal on a small tree and state what each recursive call must return to its parent. That parent-child contract is the most important part of the solution.

If you can explain the dry run without hand-waving, the code usually stops feeling memorized and starts feeling mechanical. That is the point where interview pressure drops and implementation speed improves.

Edge Cases To Test

• null root
• single-node tree
• highly skewed tree depth

These edge cases are worth testing before you trust the solution. Many DSA bugs do not come from the main idea; they come from assuming the input shape is always convenient.

Performance Notes

The implementation leans on hash-based lookup and recursion or subtree decomposition. When you review or optimize it, focus first on how many full passes it makes over the input and what extra state it keeps alive, because those two choices dominate both speed and memory use more than small syntax tweaks do.

Debug Steps

Debug steps:

• draw the subtree result expected from each recursive call
• test null and single-node trees first
• compare preorder/inorder/postorder assumptions against the code
• watch for repeated subtree work that can be collapsed

Key Takeaways

• Construct Binary Tree from Preorder and Inorder Traversal becomes easier once the central invariant is stated in plain language.
• This solution is useful because the control flow stays close to the data structure or recursion contract it depends on.
• If the implementation fails, debug the state transition first, not the syntax.