How To Think Like a Computer Scientist:
Learning With Ruby

Chapter 18: Heaps

18.1 Array implementation of a tree

18.2 Performance analysis

18.3 Analysis of mergesort

18.4 Overhead

18.5 Priority Queue implementations

18.6 Definition of a Heap

18.7 Heap remove

18.8 Heap add

18.9 Performance of heaps

18.10 Heapsort

18.11 Glossary

18.12 Exercises

How To Think Like a Computer Scientist:
Learning With Ruby