Vidyalelo
Data Structure · Q35

Heaps

Programming · Data Structure · question 35

Q35

In a binary heap, how do you locate the right child of a node at index i?

A.
2 * i + 2
Answer
B.
2 * i + 1
C.
(i - 1) / 2
D.
2 * i

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board