d-ary heap
priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2
en-US/ˈdi - ˈɛɹi ˈhip/
priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2