# Convert Sorted Array To BST: Study Guide

Convert Sorted Array To BST shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Pick the middle element as the root so left and right halves differ by at most one, then recurse. That keeps the tree height-balanced.

## 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

Always taking nums[0] as the root, which builds a linked list, not a balanced BST.

## 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 official website.