binary heap
heap data structure that takes the form of a binary tree
weak heap
combination of the binary heap and binomial heap data structures for implementing priority queues
leftist tree
priority queue implemented with a variant of a binary heap
heap data structure that takes the form of a binary tree