ConceptTheory & Algos
Augmented binary search trees
Binary search trees that store additional information or data within their nodes to support more complex queries efficiently without increasing asymptotic complexity.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.