Catalog · Introduction to Algorithms (SMA 5503) Lecture 9 of 23 Lecture 9: Relation of BSTs to Quicksort - Analysis of Random BST ← Previous Lecture 8: Universal Hashing, Perfect Hashing Next → Lecture 10: Red-black Trees, Rotations, Insertions, Deletions ✓ Mark complete Materials Transcript (PDF) ↗ transcript