ConceptTheory & Algos
BST operations
Operations on a binary search tree include finding min, max, next larger, next smaller, insert, delete, and find or search, all running in time proportional to the tree height.
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.