The document discusses different types of graphs and tree traversal orders. It provides two examples of directed and undirected graphs represented by their vertices and edges. It also shows the pre-order, post-order and in-order traversal of two tree structures.

1. ESTRUCTURA DE DATOS
JOHNNY MORILLO A.SEGUNDO NIVEL SISTEMAS
GRAFOS.
A
B C
D E F G
H J
I
PREORDEN: A,B,D,E,H,I,C,F,J,G
POSTORDEN:D,H,I,E,B,J,F,G,C,A
INORDEN: D,B,H,E,I,A,C,J,F,G
1
2 3
4 5 6 7
8
9 10
11 12 13 14
2
PREORDEN:1,2,4,8,11,5,3,6,9,12,13,10,14,7
POSTORDEN:11,8,4,5,2,12,13,9,14,10,6,7,3,1
INORDEN: 11,8,4,2,5,1,12,9,13,6,14,10,3,7

2. TIPOS DE GRAFOS
DIRIGIDOS.
N X
Y
Z O
V= {(N,X),(O,X),(O,Z),(X,O),(X,Y),(Y,N),(Y,O),(Z,N),(Z,Y),(Z,Z)}
NO DIRIGIDOS.
X
N
Y
Z O
K
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),(Y,X),(Y,Z),(Z,K),(Z,N),(Z,O),(Z,Y)}