# Merry Heap-Mass

Computer Science Level pending

image

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]$$. The array is indexed such that the first item in the array has an index of $$1$$. So $$A[1..222]$$
×

Problem Loading...

Note Loading...

Set Loading...