Heapgeordente Bäume f. Autotool

• Baum/Such/Class => Baum/Heap/Class
• voll balancierte Binärbäume (wie in Heapsort)
• leftist Heaps, • Binomialheaps

Literatur:

• https://autolat.imn.htwk-leipzig.de/building_autotool.html
• Chris Okasaki: Purely Functional Data Structures, http://www.eecs.usma.edu/webs/people/okasaki/pubs.html#cup98