Q45
How do you ensure that a binary heap remains a valid heap after multiple insertions?
A.
By performing a heapify operation after each insertion.
AnswerB.
By performing a sort operation.
C.
By rebalancing the tree manually.
D.
By ensuring nodes are inserted in sorted order.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board