InfoCoBuild

6.851 Advanced Data Structures

6.851 Advanced Data Structures (Spring 2012, MIT OCW). Instructor: Professor Erik Demaine. Data structures play a central role in modern computer science. You interact with data structures even more often than with algorithms (think Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course covers major results and current directions of research in data structure. (from ocw.mit.edu)

Lecture 15 - Static Trees

Go to the Course Home or watch other lectures:

Lecture 01 - Persistent Data Structures

Lecture 02 - Retroactive Data Structures

Lecture 03 - Geometric Structures I

Lecture 04 - Geometric Structures II

Lecture 05 - Dynamic Optimality I

Lecture 06 - Dynamic Optimality II

Lecture 07 - Memory Hierarchy Models

Lecture 08 - Cache-Oblivious Structures I

Lecture 09 - Cache-Oblivious Structures II

Lecture 10 - Dictionaries

Lecture 11 - Integer Models

Lecture 12 - Fusion Trees

Lecture 13 - Integer Lower Bounds

Lecture 14 - Sorting in Linear Time

Lecture 15 - Static Trees

Lecture 16 - Strings

Lecture 17 - Succinct Structures I

Lecture 18 - Succinct Structures II

Lecture 19 - Dynamic Graphs I

Lecture 20 - Dynamic Graphs II

Lecture 21 - Dynamic Connectivity Lower Bound

Lecture 22 - History of Memory Models