Professional Documents
Culture Documents
Chapter 12 Practice Test
Chapter 12 Practice Test
INSTRUCTIONS: Answer each question below. Once you finish taking the test, check
the answers provided in the Answer Key at the end of this test.
1. If a tree has more than one vertex, it must have at least how many vertices of
degree 1?
A: 0
B: 1
C: 2
D: none of the above
7. Suppose a tree has 75 vertices, what is the sum of the degrees in the tree?
A: 148
B: 149
C: 150
D: none of the above
8. Suppose T is a tree with a vertex of degree 7, then T must have at least how many
vertices of degree one?
A: 6
B: 7
C: 8
D: none of the above
13. Suppose T is a full binary tree with 25 internal vertices, how many vertices does
T have?
A: 26
B: 50
C: 51
D: none of the above
14. Suppose T is a binary tree with 64 terminal vertices then what is the least height
that T may have?
A: 7
B: 8
C: 9
D: none of the above
18. What is the average number of vertices visited in a search of a binary search tree
with n vertices?
A: (n2)
B: (n)
C: (lg n)
D: none of the above
24. If a graph G with n vertices has two spanning trees which are edge disjoint then
G must have at least how many edges?
A: 2n -2
B: 2n
C: 3n-3
D: none of the above
25. If a binary tree has 72 vertices what is the maximum height of the tree?
A: 6
B: 7
C: 71
D: none of the above
26. If a binary tree has 72 vertices what is the minimum height of the tree?
27. If a binary search tree is built from the input list 2 4 6 8 10 12 14, what is the
height of the tree?
A: 2
B: 5
C: 6
D: none of the above
28. If a binary search tree is built from the input list 8 4 12 2 14 6 10, what is the
height of the tree?
A: 2
B: 5
C: 6
D: none of the above
A: 10
B: 11
C: 12
D: none of the above
30. What is the weight of a minimal spanning tree for the graph below?
1. C 2. A 3. D 4. B 5. B 6. C 7. A 8. B 9. B 10. C
11. B 12. B 13. C 14. A 15. B 16. D 17. C 18. C 19. C 20. C
21. B 22. C 23. B 24. A 25. C 26. A 27. D 28. B 29. B 30. B