A complete binary min-heap is made by including all the integers from 1 to 1023 exactly once. The depth of the node in the heap is the length of the path from the root of the heap to that node. Thus the root is at depth 0. The maximum depth at which integer 9 can appear is
Can you please explain why the answer is not 3. i am not able to understand the explanation given by geeks for geeks
@jatin_wadhwa see its because you are not able to imagine the tree properly.
You are filling the tree level wise, but its a min-heap, it doesnt have to follow any particular order except maintain the properties of a heap.
I’ll share an image with you of both the heaps that should clear it out