Chapter 23.6, Problem 23.6.1CP

Explanation of Solution

Complete binary tree:

• A binary tree is said to be a complete if every level of the tree are full except the last level.
• The last level need not be full and all the leaves on the last level are placed left most.

Heap:

• A heap is considered to be binary tree if it has following properties
  • When it is complete binary tree.
  • Every node is greater than or equal to its children.

Remove the root:

• The maximum elements need to be removed, and which will be the root of the heap.
• After removing the root node the heap needs to be rebuilt to maintain the heap property.
• A node is removed using the “remove()” method

Steps in remove the node:

The below are the steps to remove a node:

Last ...