ConceptTheory & Algos
Minimum in a binary search tree
The minimum element in a binary search tree is found by repeatedly going to the left child until no left child exists.
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
2The lectures that define it or assume it, and the concepts next to it.