Vidyalelo
Data Structure · Q2

Heaps

Programming · Data Structure · question 2

Q2

Which of the following is true for a min-heap?

A.
The root node is the smallest element, and every parent node is smaller than its children.
Answer
B.
The root node is the largest element, and every parent node is larger than its children.
C.
All nodes are arranged in a complete binary tree.
D.
The tree is always balanced.

Answer: Option A

Solution

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