d-ary Heap
Description
The d-ary heap or d-heap is a priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2.
Implementation
Impleneted in Java, this project was the second out of two projects in the "Data Structures" course in Tel Aviv University.