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
This explanation is contributed by Saksham Seth.
Recommended Posts:
- GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 16
- GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 15
- GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 17
- GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 18
- GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 31
- GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 22
- GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 21
- GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 20
- GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 19
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 1
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 2
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 3
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 4
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 5
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 6
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 7
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 8
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 9
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 10
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 11
