Lecture 11: Augmenting Data Structures, Dynamic Order Statistics, Interval Trees
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: October 2005, views: 31243
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.
"Good morning. Today we're going to talk about augmenting data structures. And this is a -- Normally, rather than designing data structures from scratch, you tend to take existing data structures and build your functionality into them. And that is a process we call data-structure augmentation. And this also today marks sort of the start of the design phase of the class. We spent a lot of time doing analysis up to this point. And now we're still going to learn some new analytical techniques..."
Download slides: mit6046jf05_leiserson_lec11_01.pdf (305.3 KB)
Download mit6046jf05_leiserson_lec11_01.m4v (Video - generic video source 175.2 MB)
Download mit6046jf05_leiserson_lec11_01.rm (Video - generic video source 134.0 MB)
Download mit6046jf05_leiserson_lec11_01.flv (Video 236.2 MB)
Download mit6046jf05_leiserson_lec11_01_320x240_h264.mp4 (Video 248.6 MB)
Download mit6046jf05_leiserson_lec11_01.wmv (Video 727.1 MB)
Download mit6046jf05_leiserson_lec11_01.mp3 (Audio lecture 19.3 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !