ConceptTheory & Algos
Tree successor
The successor of a node in a binary search tree is the node with the smallest key greater 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.
Binary search tree1Tree traversal1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.