# Unique Binary Search Trees II: Practice Notes

Unique Binary Search Trees II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For every root value i in [lo,hi], take the Cartesian product of left trees from [lo,i-1] and right trees from [i+1,hi] and wire them as children.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n * Catalan(n)).

## Common mistake

Counting the trees (Unique BST I) instead of actually building each shape.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at real-time interview help.