d-ary heap
priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2
binary heap
heap data structure that takes the form of a binary tree
priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2