In the deletion operation of max heap, the root is replaced by:
A. next available value in the left sub-tree.
B. next available value in the right sub-tree.
C. first element of the last level
D. last element of the last level
Answer:D
In the deletion operation of max heap, the root is replaced by:
A. next available value in the left sub-tree. B. next available value in the right sub-tree. C. first element of the last level D. last element of the last level