ConceptMathematics
Oblivious BST sorting
An approach to sorting where elements are inserted into a binary search tree and then traversed to obtain a sorted sequence without exploiting dynamic structure decisions per query.
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.