16.2.1. Deleting a Leaf Node

Try these first

1. 1.

   What happens when you delete a leaf node?

   Hint

   Think about a node with no children.

2. 2.

   Define a predecessor in a binary search tree.

   Hint

   This node has no right child.

3. 3.

   What is the first step when deleting a leaf node?

   • Remove it directly
   • Replace it with its child
   • None of the above

   Hint

   Think of a node with no connections.

4. 4.

   True or False: A node with two children can be deleted by simply removing it.

   • True
   • False

   Hint

   Consider what needs to be preserved.

5. 5.

   Consider the binary search tree with the following structure: 30 (root), 20 (left), 40 (right), 10 (left of 20). If you delete 20, what adjustments need to be made?

   Hint

   Pay attention to the position of 10.

6. 6.

   In terms of performance, how does maintaining a balanced search tree affect delete operations? Discuss your findings.

   Hint

   Reflect on tree height and its impact on performance.