AlgoViz
← Back to the lesson
✅ Check yourself · How indexes work (B-trees)

Did it stick?

Reading is the easy part — retrieving is what makes it yours. Answer each one; you'll see WHY on every pick, right or wrong.

1Recall · 1 of 4

Finding one row WITHOUT an index is a full table scan. Finding it WITH a B-tree index is a walk down the tree. How do their speeds compare as the table grows?