Practice Predecessor Function (15.4) - Find Operations - Design & Analysis of Algorithms

Practise this section

9 questions

Flashcard drill
4 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 is the minimum value in a BST with root value 8 and left children 7, 6, 5?
Show hintHide hint
Traverse to the left-most node.
Question 2.
What is the maximum value in a BST with root 10 and right children 12, 14, 16?
Show hintHide hint
Find the right-most node.
3Question 3.
What value does the method to find a minimum return?
- The maximum value
- The left-most node
- The right-most node
Show hintHide hint
Think about how we traverse left.
4Question 4.
True or False: The predecessor of a node with children both left and right is always the maximum of the left subtree.
- True
- False
Show hintHide hint
Which subtree gives a maximum value?
Question 5.
Given a BST containing numbers 3, 5, 2, 8, find the predecessor and successor for node 3.
Show hintHide hint
Calculate both branches and pick the respective nodes.
Question 6.
Explain what happens when trying to find the successor of the maximum node in a BST.
Show hintHide hint
What defines the concept of a maximum node in a BST?

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