# Trim A Binary Search Tree: Study Guide

Trim A Binary Search Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

If the node is below low, return trim(right); if it is above high, return trim(left); otherwise rewire both children and keep the node.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (tree DFS, BST walk, or subtree 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).

## Common mistake

Deleting out-of-range nodes without promoting the in-range child, which drops valid descendants.

## 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 AI coding interview assistant.