Select the order in which the vertices are visited in a in-order traversal of the tree shown below. 8, 5, 9, 7, 1, 12, 2, 4, 11, 3 9, 5, 1, 7, 2, 12, 8, 4, 3, 11 9. 1. 2. 12, 7, 5, 3, 11, 4, 8 8, 5, 4, 9, 7, 11, 1, 12, 3, 2

Find the articulation vertices in the following graph starting at root node #2. What property do you think the root should have so that it can be checked, just like other nodes, for being an articulation vertex? 2 8 7 6 5

List the order in which Depth First Search (DFS) would visit the vertices in the graph shown below if the DFS is started at vertex A. Break ties alphabetically. Give your answer as a comma separated list of vertices such as A, B, C, etc. 2 A B 3 9. G 3 4 F I H 2 C 4 2 8 2 E D 1

Internal path length: External path length:

represent the tree show in images using arrays