GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 26

Every node in a (min) binary heap:
(A) has two children
(B) is no larger than its children
(C) is no smaller than its children
(D) has a smaller left child than right child

Answer: (B)

Explanation: In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. A min heap tree is a example of almost complete binary tree.

So, only option (B) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.