Channel Avatar

Michael Sambol @UCzDJwLWoYCUQowF_nG3m5OQ@youtube.com

116K subscribers - no pronouns set

Data structures and algorithms in X minutes. Howdy, I'm Mik

Videos Community Playlists
Recently Uploaded Popular Oldest
07:10
Analyzing algorithms in 7 minutes β€” Asymptotic Notation
06:29
Analyzing algorithms in 6 minutes β€” Intro
05:20
AVL trees in 5 minutes β€” Deletions
09:00
AVL trees in 9 minutes β€” Insertions
05:00
AVL trees in 5 minutes β€” Intro & Search
03:10
Fibonacci heaps in 3 minutes β€” Delete
09:14
Fibonacci heaps in 9 minutes β€” Decrease Key
08:05
Fibonacci heaps in 8 minutes β€” Extract Min
06:17
Fibonacci heaps in 6 minutes β€” Insert & Union
04:00
Binary search in 4 minutes
06:37
Fibonacci heaps in 6 minutes β€” Intro
05:49
Red-black trees in 6 minutes β€” Delete Fixes
08:13
Red-black trees in 8 minutes β€” Deletions
06:00
B-trees in 6 minutes β€” Deletions
06:36
B-trees in 6 minutes β€” Insertions
04:07
B-trees in 4 minutes β€” Search
05:38
B-trees in 6 minutes β€” Properties
03:57
B-trees in 4 minutes β€” Intro
05:56
Heaps in 6 minutes β€” Methods
03:29
Heaps in 3 minutes β€” Intro
03:52
Hash tables in 4 minutes
03:10
Queues in 3 minutes
02:59
Stacks in 3 minutes
04:22
Linked lists in 4 minutes
04:01
Depth-first search in 4 minutes
03:59
Breadth-first search in 4 minutes
05:13
Big-O notation in 5 minutes
05:10
Red-black trees in 5 minutes β€” Insertions (examples)
05:38
Red-black trees in 5 minutes β€” Insertions (strategy)
03:05
Red-black trees in 3 minutes β€” Rotations
03:54
Red-black trees in 4 minutes β€” Intro
04:24
Quick sort in 4 minutes
04:13
Heap sort in 4 minutes
03:03
Merge sort in 3 minutes
02:10
Bubble sort in 2 minutes
02:43
Selection sort in 3 minutes
02:19
Insertion sort in 2 minutes
04:33
Floyd–Warshall algorithm in 4 minutes
03:20
Level-order tree traversal in 3 minutes
02:19
Post-order tree traversal in 2 minutes
02:55
In-order tree traversal in 3 minutes
02:46
Pre-order tree traversal in 3 minutes
05:15
Ford-Fulkerson in 5 minutes
05:10
Bellman-Ford in 5 minutes β€” Step by step example
03:57
Bellman-Ford in 4 minutes β€” Theory
02:46
Dijkstra's algorithm in 3 minutes
01:49
Kruskal's algorithm in 2 minutes
02:17
Prim's algorithm in 2 minutes