I found it: https://he.palgrave.com/resources/sample-chapters/9780333992852_sample.pdf https://he.palgrave.com/resources/sample-chapters/9780333992... It's the

I found it: https://he.palgrave.com/resources/sample-chapters/9780333992852_sample.pdf https://he.palgrave.com/resources/sample-chapters/9780333992... It's the sample chapter from the product page on Springer: http://www.springer.com/us/book/9781403907721 http://www.springer.com/us/book/9781403907721 Maxiphobic heaps are probably the most intuitive implementation of the priority queue data structure, and they're meldable to boot. I only wish weight-balanced trees are as simple (to prove the invariant) as the height-balanced AVL trees.