MIT 6.006 Lecture 5: Binary Search Trees & Runway Reservation Scheduling
Motivated by real-time airport runway scheduling, Demaine builds augmented Binary Search Trees supporting O(h) rank and range queries.
MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Srini Devadas
More courses at http://ocw.mit.edu
Previous · Lecture 4
MIT 6.006 Lecture 4: Priority Queues, Binary Heaps & O(n) Build-Max-Heap
Next · Lecture 6MIT 6.006 Lecture 6: AVL Trees, Tree Rotations & Guaranteed O(log n) Height
Seminar notes & discussion
No public seminar notes on this lecture yet.