Merry Heap-Mass

Computer Science Level pending

Consider an array representation of a max-heap containing exactly 222 nodes. What is the index of the left most left leaf with the lowest depth?

Details and Assumptions

  • Ignore A [ 0 ] A[0] . The array is indexed such that the first item in the array has an index of 1 1 . So A [ 1..222 ] A[1..222]


The answer is 112.

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...