Lecture 9: Relation of BSTs to Quicksort, Analysis of Random BST
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: October 2005, views: 4172
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
"So, we're going to talk today about binary search trees. It's something called randomly built binary search trees. And, I'll abbreviate binary search trees as BST's throughout the lecture. And, you of all seen binary search trees in one place or another, in particular, recitation on Friday. So, we're going to build up the basic ideas presented there, and talk about how to randomize them, and make them good. So, you know that there are good binary search trees, which are relatively balanced, something like this. The height is log n..."
Download slides: mit6046jf05_demaine_lec09_01.pdf (319.5 KB)
Download mit6046jf05_demaine_lec09_01.m4v (Video - generic video source 169.7 MB)
Download mit6046jf05_demaine_lec09_01.rm (Video - generic video source 130.1 MB)
Download mit6046jf05_demaine_lec09_01.flv (Video 226.4 MB)
Download mit6046jf05_demaine_lec09_01.wmv (Video 715.8 MB)
Download mit6046jf05_demaine_lec09_01.mp3 (Audio lecture 18.8 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !