Consider any array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i <= n), the index of the parent is
(A)
i – 1
(B)
floor(i/2)
(C)
ceiling(i/2)
(D)
(i+1)/2
Answer: (B)
Explanation:
Binary heaps can be represented using arrays: storing elements in an array and using their relative positions within the array to represent child-parent relationships. For the binary heap element stored at index i of the array, Parent Node will be at index: floor(i/2) Left Child will be at index: 2i Right child will be at index: 2*i + 1 .
Hence Option(B) is the correct answer.
Quiz of this Question
Please comment below if you find anything wrong in the above post