C-Programming-data-structure || 2016 SET 22 || NAT || 2-mark || Module 3: Tree | Graph | Hashing

A complete binary min-heap is made by including each integer in [1, 1023] exactly once. The depth of a 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 _____________

2016 SET 22 || NAT || 2-mark