In binary heap, whenever the root is removed then the rightmost element of last level is replaced by the root. Why?

A) It is the easiest possible way.

B) Because left and right subtree might be missing.

C) To make sure that it is still complete binary tree.

D) None of the above

Correct Answer : To make sure that it is still complete binary tree.

Explanation : A binary heap (whether max or min) has to satisfy the property of complete binary tree at all times.

Top Trending Technologies MCQ's

Machine Learning

Artificial Intelligence

Natural Language Processing

Top Trending Technologies Interview Questions