16.2.5. Complexity of Tree Operations

Try these first

1. 1.

   What happens when you try to insert a duplicate value into a binary search tree?

   Hint

   Think about the importance of maintaining unique values.

2. 2.

   Define a leaf node.

   Hint

   What do you notice about its connections?

3. 3.

   What should you do if a value already exists in the tree when trying to insert it?

   • Insert the value anyway
   • Do nothing
   • Overwrite the existing value

   Hint

   Remember the key point about duplicates.

4. 4.

   True or False: A leaf node can have children.

   • True
   • False

   Hint

   Consider the definition of a leaf node.

5. 5.

   Given a binary tree structure, insert the values 15, 25, and 10 sequentially. Explain your steps.

   Hint

   Visualize or sketch the tree after each insertion.

6. 6.

   How would you delete a node with two children in a tree? Describe the algorithm.

   Hint

   Which node will help preserve order?