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 u please explain im unable to understand this
