ConceptTheory & Algos
(2,5) Trees
A B-tree variant where the number of children of every node is between 2 and 5, allowing both efficient inserts and deletes.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
2-3 Trees1B-tree1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.