Practice Searching In Binary Search Trees (1.12) - Search Trees - Design & Analysis of Algorithms - Vol 2

Practice: Searching in Binary Search Trees

Lesson 1.12Search Trees

Practise this section

10 questions

Flashcard drill
3 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
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What defines a binary search tree?
Show hintHide hint
Think about how the values are arranged in a BST.
Question 2.
Describe in-order traversal in a BST.
Show hintHide hint
Consider the sequence of visiting nodes.
3Question 3.
What is the time complexity of searching in a balanced binary search tree?
- O(n)
- O(log n)
- O(1)
Show hintHide hint
Consider how binary search works in reducing the search space.
4Question 4.
True or False: In a binary search tree, all values in the left subtree are greater than the node's value.
- True
- False
Show hintHide hint
Remember the defining property of a BST.
Question 5.
You have a series of values to insert into a binary search tree: 10, 20, 5, 3, 7, 15. Construct the tree and perform in-order traversal.
Show hintHide hint
Visualize inserting in sequential order while following the BST property.
Question 6.
Given a binary search tree with values (5, 3, 8, 1, 4, 7, 9), if you were to delete the node with value 3, how would you proceed, and what would the new in-order traversal be?
Show hintHide hint
Understand that deleting a node involves maintaining the BST properties.

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