A D-ary heap is a generalization of binary heap where each node has D children, instead of 2 children. The value of each node is greater than or equal to its children, and the root node has the highest value.
A D-ary heap is a generalization of binary heap where each node has D children, instead of 2 children. The value of each node is greater than or equal to its children, and the root node has the highest value.