ConceptTheory & Algos
Weight-balanced BST
A binary search tree where the weight of a subtree is defined as the number of descendant leaves, achieving query time and linear space.
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
3The lectures that define it or assume it, and the concepts next to it.