Category Archives: Heap

K-ary Heap

3.5

Prerequisite – Binary Heap K-ary heaps are a generalization of binary heap(K=2) in which each node have K children instead of 2. Just like binary… Read More »