\(d\)-ary Heaps

Computer Science Level pending

A \(d\)-ary heap is a generalization of a binary heap where each node has \(d\) children, instead of the usual 2. A ternary heap is a 3-ary heap.

A ternary heap contains 100 nodes. What is the number of nodes at the bottom-most level?

×

Problem Loading...

Note Loading...

Set Loading...