ConceptTheory & Algos
Balanced binary search tree
A binary search tree where the height is proportional to the logarithm of the number of nodes, ensuring efficient operations.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
5Connections
15The lectures that define it or assume it, and the concepts next to it.
Concepts9
- Binary search tree
- Asymptotic notation
- Height of a BST
- Tree height
- Cache-oblivious static search tree layout
- Euler-tour trees