Video details loaded
HomeMIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503),Lecture 9: Relation of BSTs to Quicksort - Analysis of Random BST
MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503),

Video 9 of 10

Previous: Lecture 8: Universal Hashing, Perfect HashingNext: Lecture 10: Red-black Trees, Rotations, Insertions, Deletions

Lecture 9: Relation of BSTs to Quicksort - Analysis of Random BST

1:21:22

Up Next

Lecture 10: Red-black Trees, Rotations, Insertions, Deletions

Continue

Topics covered: Relation of BSTs to Quicksort - Analysis of Random BST

Instructors: Prof. Erik Demaine, Prof. Charles Leiserson