Follow Us :

Nov2017 cs Q19

0. Consider an 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:

  • Option : C
  • 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
Cancel reply
Cancel reply