d d -ary Heaps

A d d -ary heap is a generalization of a binary heap where each node has d 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?


The answer is 60.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Hasmik Garyaka
Oct 24, 2017

On first, second levels ...1+3+9+27=40 60 remain and 60<81

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...