16.2. Inserting Duplicate Values

Try these first

1. 1.

   What happens if you try to insert a duplicate value in a binary search tree?

   Hint

   Think about maintaining unique values in the structure.

2. 2.

   What direction do you take when inserting a value smaller than the current node?

   Hint

   Smaller values go to the left!

3. 3.

   What will happen if you try to insert a value that already exists in a binary search tree?

   • The tree will allow duplicate values
   • The tree will remain unchanged
   • The value will replace the existing value

   Hint

   Remember the uniqueness requirement!

4. 4.

   True or False: A binary search tree must always contain at least one node.

   • True
   • False

   Hint

   Consider what the minimum structure of a tree is.

5. 5.

   Construct a binary search tree by inserting the values [15, 10, 20, 8, 12, 17, 25]. Draw the tree structure and explain each step.

   Hint

   Keep track of where each value goes!

6. 6.

   You have a binary search tree and want to insert 25 after inserting 15, 10, and 20. Describe the traversal steps taken and the reasoning.

   Hint

   Think about how each comparison determines the next path in the tree.