Data Structures | Heap | Question 5
Consider a binary max-heap implemented using an array. Which among the following arrays represents a binary max-heap?
(More than one option correct)
Answer: (A) (C)
A tree is max-heap if data at every node in the tree is greater than or equal to it’s children’ s data. In array representation of heap tree, a node at index i has its left child at index 2i + 1 and right child at index 2i + 2.
For Example :-
25 / \\ / \\ 14 16 / \\ / \\ / \\ / \\ 13 10 8 12
So, the correct answer are A and C.
Quiz of this Question
Please comment below if you find anything wrong in the above post
My Personal Notes arrow_drop_up
Please Login to comment...