heap
tree-based data structure in computer science
pairing heap
type of heap data structure with relatively simple implementation and excellent practical amortized performance
binomial heap
priority queue made from heap-ordered trees with power-of-two sizes
Fibonacci heap
heap data structure made of a forest of trees
d-ary heap
priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2
soft heap
variant on the simple heap data structure that has constant amortized time for 5 types of operations
skew heap
heap data structure implemented as a binary tree