A min- Heap is a complete binary tree.
(A)
True
(B)
False
Answer: (A)
Explanation:
A max-heap is a special Tree-based data structure in which the tree is a complete binary tree. A complete binary tree is a special type of binary tree where all the levels of the tree are filled completely except the lowest level nodes which are filled from as left as possible.
Complete Binary Tree
Hence Option(A) is the correct answer.
Quiz of this Question
Please comment below if you find anything wrong in the above post