Binomial heaps (part 1/3): Introduction and worst-case analysis

Introduction to binomial heaps. I introduce binomial trees, binomial heaps, the operations on a binomial heap, and the worst-case running time of the operations. The amortized analysis is in separate videos.

00:00 mergeable priority queues
04:00 binomial trees
08:13 proof of lemma on bin. trees
13:23 binomial heaps
17:41 operations on a binomial heap
23:40 operations by example
27:38 running time of operations