Analyzing algorithms in 7 minutes — Asymptotic Notation

Analyzing algorithms in 6 minutes — Intro

AVL trees in 5 minutes — Deletions

AVL trees in 9 minutes — Insertions

AVL trees in 5 minutes — Intro & Search

Fibonacci heaps in 3 minutes — Delete

Fibonacci heaps in 9 minutes — Decrease Key

Fibonacci heaps in 8 minutes — Extract Min

Fibonacci heaps in 6 minutes — Insert & Union

Binary search in 4 minutes

Fibonacci heaps in 6 minutes — Intro

Red-black trees in 6 minutes — Delete Fixes

Red-black trees in 8 minutes — Deletions

B-trees in 6 minutes — Deletions

B-trees in 6 minutes — Insertions

B-trees in 4 minutes — Search

B-trees in 6 minutes — Properties

B-trees in 4 minutes — Intro

Heaps in 6 minutes — Methods

Heaps in 3 minutes — Intro

Hash tables in 4 minutes

Queues in 3 minutes

Stacks in 3 minutes

Linked lists in 4 minutes

Depth-first search in 4 minutes

Breadth-first search in 4 minutes

Big-O notation in 5 minutes

Red-black trees in 5 minutes — Insertions (examples)

Red-black trees in 5 minutes — Insertions (strategy)

Red-black trees in 3 minutes — Rotations