Exam-style question
Try this first
Which statement correctly defines a tree?.
- A.A connected, undirected graph with no cycles
- B.A directed graph in which every vertex has two children
- C.A graph containing exactly one cycle
- D.A graph in which every vertex has a parent
Model answer
What a good answer should say
- A connected, undirected graph with no cycles
Explanation
Why this works
A tree is connected, undirected and contains no cycles. It does not have to have a root.
Common mistake
No common mistake is linked to this question yet.