# Balance A Binary Search Tree: Explained

Balance A Binary Search Tree is a common tree question in coding rounds. Below is how I talk through it in an interview setting.

## Key idea

Flatten with inorder into a sorted array, then rebuild by always choosing the middle element as root.

## Steps to say out loud

1. Restate the input and output, and ask about empty trees and duplicate values.
2. Name the traversal (DFS or BFS) and what each call returns.
3. Code it, then trace a three-node example by hand.

## Complexity

O(n) time and space.

## Common mistake

Trying rotations (AVL) in an interview is overkill; the rebuild is the expected answer.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edge cases. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob.