How a B-Tree Index Works

Talk it through with a coach who asks guiding questions and gives hints until you reach the answer. Pass to mark the challenge as completed.

The problem

  • easy

Explain how a B-tree index on an email column lets the database find one user among ten million rows without reading the whole table, using the analogy of a book's index if it helps.

Talk this problem through with an AI coach

Sign in with Google to start a free voice session — no credit card needed.

Start free →