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
Doubt on binary heap quiz
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.