ConceptTheory & Algos
Binary search tree model
A restricted pointer machine model where data must be stored as keys in a binary search tree and the only allowed operations are pointer walks and node rotations.
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.