Deap
A deap is a double-ended heap that supports the double-ended priority operations of insert, delet-min, and delete-max. Similar to min-max heap but deap is faster on these operations by a constant factor, and the algorithms are simpler.
Definition: A deap is a complete binary tree that is either empty or satisfies the following properties:
...
