16. Insertion in a Search Tree

Try these first

1. 1.

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

   Hint

   Think about maintaining the uniqueness in a search tree.

2. 2.

   Can a search tree be empty? If so, what happens when a value is inserted?

   Hint

   Consider the starting point of tree structure.

3. 3.

   What do you do if you try to insert a value that is already in the tree?

   • Insert it again
   • Do nothing
   • Overwrite the existing value

   Hint

   Think about the uniqueness of nodes in a tree.

4. 4.

   True or False: When inserting into a search tree, you need to always find an empty place to insert.

   • True
   • False

   Hint

   Insertion requires finding a proper place.

5. 5.

   You are given a tree with values [30, 20, 40]. Write down the structure after inserting the value 25.

   Hint

   Trace the insertion path carefully to locate where 25 fits.

6. 6.

   If the insertion sequence is [50, 30, 70, 30, 10, 90], what will be the final structure of the tree?

   Hint

   Count how often a number repeats to understand the handling of duplicates.