AVL trees in 9 minutes — Insertions

Big-O notation in 5 minutes

Bubble sort in 2 minutes

In-order tree traversal in 3 minutes

AVL trees in 5 minutes — Intro & Search

AVL trees in 5 minutes — Deletions

Fibonacci heaps in 8 minutes — Extract Min

Linked lists in 4 minutes

Bellman-Ford in 5 minutes — Step by step example

Depth-first search in 4 minutes

Bellman-Ford in 4 minutes — Theory

Kruskal's algorithm in 2 minutes

Floyd–Warshall algorithm in 4 minutes

Ford-Fulkerson in 5 minutes

Red-black trees in 6 minutes — Delete Fixes

Heaps in 6 minutes — Methods

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

Selection sort in 3 minutes