3

0

1

2

An external node

The only node that has no children

The node with the highest number of children

The only node without a parent

This is the element at index 0 of the tree

This is the list with the highest number of children

This is the list whose index is not part of any children's list

This is the item for which the children's list is empty

This is the tuple whose index does not appear in any list of children

It is the tuple that is at index 0 of the tree

This is the tuple whose list of children is empty

This is the tuple with the highest number of children

A cycle is a chain where the same vertex can appear multiple times

Two vertices can be linked by multiple edges

It can contain cycles

The degree of a vertex is the number of edges it's connected to

Depth-First Search (DFS)

Breadth-First Search (BFS)

Neither

Both

4

3

1

2

    A  B  C  D
A [ 1  1  1  0 ]
B [ 1  1  1  1 ]
C [ 1  1  1  1 ]
D [ 0  1  1  1 ]

    A  B  C  D
A [ 0  1  0  1 ]
B [ 1  0  1  0 ]
C [ 0  1  0  1 ]
D [ 1  0  1  0 ]

    A  B  C  D
A [ 0  1  1  0 ]
B [ 1  0  1  1 ]
C [ 1  1  0  1 ]
D [ 0  1  1  0 ]

    A  B  C  D
A [ 0  1  1  1 ]
B [ 1  0  0  1 ]
C [ 1  0  0  1 ]
D [ 1  1  1  0 ]