min heap

Question

A complete binary min-heap is made by including each integer in [0-1023] exactly once

Maximum height of heap is X  and Minimum height of heap is Y. Values of X and Y are?

Comments

Even I think it X = 10 and Y = 10,

@MINIPanda for fixed no. of nodes can there be more than 1 arrangement in heap possible = yes because

consider this min-heap = 1 2 3 4 5 6 7 and another 1 3 2 4 5 6 7

These both min-heaps are valid where nodes are fixed n = 7, but min-heap are not like binary tree they always tend to form almost complete binary tree and hence in any arrangement we get maximum height = O(Log₂n)

https://www.cs.cmu.edu/~adamchik/15-121/lectures/Binary%20Heaps/heaps.html

---

Swapnil Naik

I meant the arrangement of nodes(i.e. structure of the heap) not the key values..

---

ohk cool