Practice Recursive Insert Case (16.3) - Insertion in a Search Tree - Design & Analysis of Algorithms - Vol 2

Practice: Recursive Insert Case

Lesson 16.3Insertion in a Search Tree

Practise this section

9 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What should you do if you want to insert a value into an empty search tree?
Show hintHide hint
Think about what the starting point of a tree might be.
Question 2.
Can you insert a duplicate value into a search tree?
Show hintHide hint
Consider how duplicates might affect order.
3Question 3.
What should you do when inserting a value that is already present in the tree?
- Insert it again
- Ignore the insertion
- Replace the existing value
Show hintHide hint
Think about how a duplicate might affect the tree structure.
4Question 4.
True or False: Inserting into an empty search tree requires creating a new root node.
- True
- False
Show hintHide hint
Consider the definition of what a tree's root is.
Question 5.
Given the following tree with values [15, 10, 20, 8, 12, 18, 25], what will it look like after inserting the value 17?
Show hintHide hint
Draw the tree and visualize the path driven by comparisons.
Question 6.
If you have a skewed tree where every node only has a right child, what would the structure look like after inserting the value that should be its left child?
Show hintHide hint
Consider how balancing might take effect in real scenarios.

5 more questions in this section. Enroll free to practise them all.