Practice Binary Tree Basics (1.8) - Search Trees - Design & Analysis of Algorithms - Vol 2

Practice: Binary Tree Basics

Lesson 1.8Search Trees

Practise this section

8 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
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is a binary tree?
Show hintHide hint
Think about how trees in nature branch out.
Question 2.
What’s the difference between a binary tree and a binary search tree?
Show hintHide hint
Consider how values are arranged in each structure.
3Question 3.
What does a binary search tree allow us to do efficiently?
- A. Search for values
- B. Only store values
- C. Sort values in any order
Show hintHide hint
Remember the main purpose of a BST.
4Question 4.
True or False: In a binary tree, each node can have more than two children.
- True
- False
Show hintHide hint
Think about the definition of a binary tree.
Question 5.
Construct a binary search tree from the following list of values: [7, 4, 9, 2, 6, 8, 10]. Then, perform an in-order traversal and list the returned values.
Show hintHide hint
Start by placing the first value at the root and continue adding values based on their relation to existing nodes.
Question 6.
Explain how the height of a binary search tree affects its efficiency during searching. Provide a scenario where the height is maximized.
Show hintHide hint
Consider what happens when you insert elements in a non-random order.

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