
Intro to Trees
Interactive Video
•
Mathematics
•
9th - 12th Grade
•
Practice Problem
•
Hard
Standards-aligned
Laura Tadder
FREE Resource
Standards-aligned
5 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
A tree cannot have any cycles
True
False
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
A tree with 8 nodes should have how many edges?
7
8
9
16
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
In the adjacency listing, what node is NOT connected (neighboring) node 4?
4 --> [1,5,8]
1
5
8
0
Tags
CCSS.5.G.A.2
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Root trees are typically
Directed
Undirected
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
How many "child" nodes can each node have to be considered a binary tree?
At most 2
At least 2
There is no exact number
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 Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?