1. The document contains a graph with nodes labeled A through J and directed edges between them. 2. It also contains three ordered lists showing the pre-order, post-order, and in-order traversals of a binary tree with nodes labeled 1 through 7. 3. Finally, it describes directed and undirected graphs with nodes labeled K through Z and edges between them.

1. A
B C
PREORDEN: ABDEHICFJG
D E F G POSTORDEN:DHIEBJFGCA
INORDEN: DBHEIACJFG
H I J
1
2 3
PREORDEN: 1248115369121310147
4 5 6 7
POSTORDEN:1184521213914106731
INORDEN:1184251129136141037
8 9 10
10
11 12 13 14
DIRIGIDO
V={(N,X),(O,X),(O,Z),(X,O),(X,Y),(Y,N),(Y,O),(Z,N),(Z,Y),(Z,Z)
N X
8 8
10 10
Y
8
10
Z O
8 8
10 10

2. NO DIRIGIDO
N X
8 8
10 10
Y
8
10
Z O
8 8
10 10
K
8
V={(K,O),(K,Z),(N,X),(N,Y),(N,Z),(O,K),(O,O),(O,X),(O,Y),(O,Z),(X,N),(X,O),(X,X),(X,Y),(Y,N),(Y,O),
10
(Y,X),(Y,Z),(Z,K),(Z,N),(Z,O),(Z,Y)}