Here answer is 8. With 1024 nodes, we can easily build min heap Check following diagram
Now once we place 1-9 then remaining elements can be placed easily to fill up heap (While keeping heap property of course) Total elements we need for this heap is 512, we have given 1024 ! So Yes, 8 is answer !
yes ...heap should be a complete binary tree and here also it is a complete BT. Because we have total 1024 elements and with height(or depth) = 9 we can have total (2^{(}^{9+1) }- 1) = 1023 element in complete BT.
babai in image akash just put imagination of tree .. in his ans right of root node i.e. 1 there are 255 nodes in arragment which satisfies the given condition... like then right of node 2 there are 127 nodes... like this tree will be look like...
9716 Points
5560 Points
5290 Points
4910 Points
4498 Points
4418 Points
4236 Points
4226 Points
3848 Points
3808 Points
Gatecse