CSD201_PART3

Consider the AVL tree below. What is the breadth-first traversal of the tree after inserting a node with value 24?

• A. 35, 22, 39, 12, 32, 37, 24, 27

• B. 35, 22, 39, 12, 32, 37, 27, 24

• C. 35, 22, 39, 12, 37, 27, 24, 32

• D. 35, 22, 39, 12, 27, 37, 24, 32

What is the breadth-first traversal of a tree below after deleting the node 30 by merging?

• A. 25, 15, 40, 5, 20, 35, 10

• B. 15, 5, 25, 10, 20, 40, 35

• C. 15, 5, 40, 10, 35, 25, 20

• D. 25, 15, 40, 5, 35, 10, 20

What is the breadth-first traversal from the vertex F of a graph below? (visit nodes in ABC order if there are some nodes having the same selection ability)

• A. F, C, D, G, B, A, E

• B. F, C, B, D, G, A, E, H

• C. F, C, D, G, A, B, E, H

• D. F, C, D, G, B, A, E, H

Given a graph below. What is the output of depth-first traversal from vertex B? (visit nodes in ABC)

• A. B, A, E, G, C, D, F, H

• B. B, A, E, G, F, D, C

• C. B, A, C, E, G, F, D, H

• D. B, A, E, G, F, D, C, H

Consider the AVL tree below. What is the breadth-first traversal of the tree after inserting a node with value 28?

• A. 35, 22, 39, 12, 32, 37, 27, 28

• B. 35, 22, 39, 12, 32, 37, 28, 27

• C. 35, 22, 39, 12, 28, 37, 27, 32

• D. 35, 22, 39, 12, 37, 28, 27, 32

Given a binary search tree T below. What is a result of the breadth-first traverse of T after you delete by merging node 3?

• A. 6, 1, 8, 2, 4, 7, 9

• B. 6, 1, 8, 2, 7, 9, 4

• C. 6, 2, 8, 1, 4, 7, 9

• D. 6, 2, 1, 4, 8, 7, 9

Consider the AVL tree below. What is the breath-first traversal of the tree after inserting a node with value 33?

• A. 40, 25, 50, 15, 33, 45, 30, 35

• B. 40, 25, 50, 15, 30, 45, 33, 35

• C. 40, 25, 50, 15, 30, 45, 35, 33

• D. 40, 25, 50, 15, 35, 45, 30, 33

Given a binary search tree T below. What is a result of the breadth-first traverse of T after you delete by copying the root (node 5)?

• A. 4, 2, 7, 1, 8, 3, 9

• B. 2, 1, 4, 7, 8, 3, 9

• C. 4, 2, 7, 1, 3, 8, 9

• D. 2, 1, 4, 3, 7, 8, 9

What is the breadth-first traversal of a tree below after deleting the node 15 by merging?

• A. 30, 5, 40, 25, 35, 10, 20

• B. 30, 5, 40, 10, 25, 35, 20

• C. 30, 5, 40, 10, 35, 25, 20

• D. 30, 25, 40, 5, 20, 10, 35

Suppose a multigraph G is given blow (view picture). Which of the following is the Euler cycle from the vertex D, created by the above algorithm?

• A. D, B, C, D, B, A, D

• B. D, C, B, D, B, A, D

• C. D, A, B, C, D, B, D

• D. D, B, D, C, B, A, D

• E. D, A, B, C, D