11.1 Flashcards

1
Q

What is a tree

A

A connected undirected graph with no simple circuits

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

When is an undirected graph a tree

A

if and only if there is a unique simple path between any two of its vertices

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Difference between m-ary tree and full m-ary tree

A

m-ary: if every internal vertex has no more than m children
full m-ary tree: if every internal vertex has exactly m children

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How many edges does a tree with n vertices have

A

A tree with n vertices has n-1 edges

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How many vertices does a full m-ary tree with i internal vertices have

A

n = mi+1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly