# Priority Search Tree Three Sided: Walkthrough

Priority Search Tree Three Sided shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A heap on one coordinate and a search tree on the other answers three-sided range reporting (unbounded on one side) in logarithmic time plus output size.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(log n + k).

## Common mistake

Treating it like a four-sided range tree and missing the heap-order prune on the unbounded side.

## 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 try it free.