Open In App

UGC-NET | UGC-NET CS 2017 Dec 2 | Question 21

Like Article
Like
Save
Share
Report

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: 

 

(A)

ceiling (i/2)

(B)

floor (i/2)

(C)

ceiling ((i+1)/2)

(D)

floor ((i+1)/2)


Answer: (B)

Explanation:

Refer: GATE-CS-2001 | Question 15 

To find parent of node at i index we have to find floor(i/2). 

So, option (C) is correct.
 


Quiz of this Question
Please comment below if you find anything wrong in the above post


Last Updated : 15 Mar, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads