4.2 Data Structures Flashcards

1
Q

A Tree

A

A connected graph with no cycles

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

A Rooted Graph

A

A graph where one of the nodes has been distinguished as a root

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

A Rooted Tree

A

A Rooted Tree

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

Assigning one of the nodes of a tree as a root allows us to

A

Talk about parents and children

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