ConceptTheory & Algos
Tree predecessor
The predecessor of a node in a binary search tree is the node with the largest key smaller than the node's key.
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.