Binary Search Tree
Authored by PANDU WICAKSONO
Computers
University
Used 6+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
7 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What does the left subtree of a node in a Binary Search Tree contain?
Elements with duplicate keys
Elements equal to the node
Elements smaller than the node
Elements greater than the node
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which operation is used to find a key in a Binary Search Tree?
remove(x)
insert(x)
update(x)
search(x)
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
How is insertion into a Binary Search Tree done?
Recursively
Using a stack
Using a queue
Iteratively
4.
MULTIPLE SELECT QUESTION
30 sec • 1 pt
What is the correct algorithm for deletion in a Binary Search Tree?
Find the successor and remove it
Find the predecessor and remove it
Delete the root node
Delete the leaf nodes
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the property of Binary Search Tree that makes searching easy?
Elements are sorted in descending order
Elements are sorted in ascending order
Elements are randomly arranged
Elements are stored in a linked list
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which operation is used to insert a new key into a Binary Search Tree?
search(x)
remove(x)
insert(x)
find(x)
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What does the right subtree of a node in a Binary Search Tree contain?
Elements greater than the node
Elements smaller than the node
Elements equal to the node
Elements with duplicate keys
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
