16.2. Deletion in a Search Tree

Try these first

1. 1.

   What is a leaf node?

   Hint

   Think about the structure of the tree.

2. 2.

   How do you delete a leaf node?

   Hint

   What happens to the parent's pointer?

3. 3.

   What happens when you delete a leaf node?

   • It falls off the tree
   • It remains in the tree
   • The tree becomes unbalanced

   Hint

   Remember what a leaf is in relation to the tree.

4. 4.

   Deleting a node with one child requires promoting the child. True or False?

   • True
   • False

   Hint

   Think about the relationship between the node and its child.

5. 5.

   You are given a binary search tree. Explain in detail how you would delete a node with both children.

   Hint

   Remember the steps involved in replacing a node with two children.

6. 6.

   Design a function that efficiently deletes a node from a binary search tree. Describe how you would handle all possible cases.

   Hint

   Break down the process of deletion based on node characteristics.