Consider the following graph.
A graph with 3 vertices and 5 edges is shown.
Vertex a is connected to vertex b by edge e1, by edge e2, by edge e3, and by edge e4.
Vertex b is connected to vertex a by edge e1, by edge e2, by edge e3, and by edge e4 and to vertex c by edge e5.
Vertex c is connected to vertex b by edge e5.
(a) How many paths are there from a to c?
e1e3e5
(b) How many trails are there from a to c?
28
(c) How many walks are there from a to c?
In each of (a) and (b), use the steps of Algorithm 10.5.1 to build a binary search tree for the given keys. Use numerical order and insert the keys in the order they are listed. The elements in the lists are the same, but the trees are different because the lists are ordered differently. (Enter NONE in any unused answer blanks.)
(a)
12,
28,
26,
7,
16,
9,
8
A binary search tree with four rows and eleven vertices is shown. The vertex in the first row is connected by edges to left and right children. The two vertices in the second row are connected by edges to left and right children. The four vertices in the third row are connected by edges to left children. There is an answer blank at each vertex.
(b)
12,
8,
7,
26,
16,
28,
9
Please take your time
Consider the following graph.
e1 e2 e3
es
e4
?
(e) How many paths are there from a to c?
135
(b) How many trails are there from a to c?
28
(c) How many walks are there from a to c?
45
In each of (a) and (b), use the steps of Algorithm 10.5.1 to build a binary search tree for the given keys. Use numerical order and insert the keys in the order they are listed. The elements in the lists are the same, but the trees are different because the lists are ordered differently. (Enter NONE in any unused answer blanks.)
(a)
12, 28, 26, 7, 16, 9, 8
12
4
26
8
16
(b)
12, 6, 7, 26, 16, 22, 9
12
6
16
28
7
6
16
28
