# Convert Sorted List To Binary Search Tree: Study Guide

Convert Sorted List To Binary Search Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Count n or use slow/fast to find the mid as the root (inorder simulation): recurse left on the first half, take the mid node as root, recurse right on the rest. 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 (linked-list rewiring, two pointers, or a monotonic stack) 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 the head as the root, which builds a linked-list-shaped tree.

## 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 best AI tool for coding tests and OAs.