A - Level Tree Traversal
Authored by Jamie Horsman
Computers
11th Grade
CCSS covered
Used 72+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
11 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
What is the Big O Notation of Merge Sort?
O(n)
O (n log n)
O(log n)
O(n2)
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Does Breadth-first search use a queue or a stack?
Stack
Queue
Both
neither
3.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?
Pre-Order
In-Order
Post-Order
Monastic Orders
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
A list must be in order for a Binary search to take place
True
False
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
displays data items in a hierarchical view
6.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
A tree is composed of ____ connected by edges or lines.
7.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
A Kind of tree where every node in a tree can have at most two children.
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?
