Exercise
l
How could you represent a tree in
which both nodes and arcs have
labels?
a
b
c
d
e
0
1
1
2