Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

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

  • Last Updated : 15 Mar, 2018

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) floor ((i+1)/2)
(B) ceiling ((i+1)/2)
(C) floor (i/2)
(D) ceiling (i/2)

Answer: (C)

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

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!