Lecture 9: Relation of BSTs to Quicksort, Analysis of Random BST  thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

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

Published on Feb 10, 200922763 Views

//"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