Guest Session: 1 Question Remaining.
Create Account
to save progress.
Login
Graph Theory
hard
0:00.0
What is the maximum number of leaves in a tree with
n
n
n
vertices (
n
≥
3
n \geq 3
n
≥
3
)?
A
n-1
B
n-2
C
n/2
D
2
Submit Answer