1. When did you first encounter balanced search trees and heaps for priority queues?
2. Which variations (red-black trees, heaps) did you cover?
3. Did you have you implement it from scratch?
4. If not, what did you do with existing code?
5. How many semesters total did you spend studying balanced search trees (among other topics)?
To be cross-posted to compscibooks