ConceptTheory & Algos
2-3 Tree insertion amortized analysis
The amortized number of node splits per insertion in a 2-3 tree is bounded by a constant, despite a worst-case bound of logarithmic splits.
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.
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.