This is analogical to Binary heap, but there are N descendants. The complexities remain the same, but for them to be efficient, use powers of two.
A d-ary heap typically runs much faster than a binary heap for heap sizes that exceed the size of the computer’s cache memory.