Consider the min heap implemented using following number 10, 20, 30, 40, 50, 60, 70, 80 and array's index start with 0. What is the correct position of 80?
Answers
Answered by
0
Answer:
Consider a binary max- heap implemented using an array. ... (A) 25,12,16, 13,10,8,14 ... In array representation of heap tree, a node at index i has its left child at index 2i + 1 and .
Similar questions