Datastructures as taught in 6.006

1. Sequences

   • Dynamic Array
   • Linked List
   • Static Array

2. Sets

   • Sorted Array

3. Queues

   • Normal Queue
   • Priority Queue (Max)
   • Min Priority Queue

4. Stacks

5. Heaps

   • Min Heap
   • Max Heap

6. Trees

   • AVL Trees
   • Binary Tree (Sequence Tree)
   • Binary Search Tree (Set Tree)

7. Union Find

8. Hash Tables

   • Double Hashing
   • Separate Chaining

9. Graphs

Resources

• 6.006
• 6.006 Fall 2011
• William Fiset