Module 9 · 3 lessons · about 155 minutes

Heaps and tries

How a heap keeps the smallest item on top in an ordinary list, top-k and merging with heapq, the two-heap median, and prefix trees for words.