16.2.3. Deleting a Node with Two Children

Try these first

1. 1.

   What is the first step in deleting a node from a binary search tree?

   Hint

   Think about how we select a node to delete based on its value.

2. 2.

   What do we call the node with the maximum value in the left subtree?

   Hint

   Remember the positions of nodes around the targeted node.

3. 3.

   What is the first step in deleting a node in a binary search tree?

   • Replace the node
   • Identify the node
   • Remove the node

   Hint

   Focus on the value of the node when thinking of deletion.

4. 4.

   True or False: The predecessor is the largest node in the right subtree.

   • True
   • False

   Hint

   Remember how the subtree structures are defined.

5. 5.

   Given a binary search tree with nodes 20, 15, 25, 10, 5, what would the tree look like if you delete the node with the value 15, replacing it with its predecessor?

   Hint

   Visualize the tree structure to help you understand the positions.

6. 6.

   How would deleting node 25 impact a tree containing nodes 10, 20, 25, and 30 where 25 has two children?

   Hint

   Think about how the ordering of numbers changes with the deletion.