C Sc 227 Last Day Quiz Practice Questions SL _______________ Name ____________________
1. Is this a Binary Search Tree (yes or no)? _______
M
R
G
G
X
H
2. Is this a Binary Search Tree (yes or no)? _______
M
H
R
X
G
Q
3. What potential benefit is there to using a binary search tree rather than an array to store the same
collection of elements?
4. Draw the a picture of the binary search tree that results from the following code that uses your
OrderedMap class:
OrderedMap<String, Integer> aBST = new OrderedMap<String, Integer>();
aBST.put("Matrix", 5);
aBST.put("Antz", 3);
aBST.put("Bean", 2);
aBST.put("Shaft", 2);
aBST.put("Scream", 3);
aBST.put("Titanic", 4);
5. Add a public method named maxKey to OrderedMap that returns a reference to the object with the
maximum value. Write two different implementations of a private helper method. One method must have an
iterative solution. The other method will have a recursive solution. The code shown to the left must generate
the output shown to the right. Assume that when this code runs all methods are in your class OrderedMap.
Remember that the OrderedMap class has an instance variable named root to reference the root of the BST
in OrderedMap and it uses MapNode objects to store objects. You may assume the key has the compareTo
method (it implements Comparable).
OrderedMap<Double, String> doubleTree =
new OrderedMap<Double, String>();
System.out.println("\nMax key is " + doubleTree.maxKey());
OrderedMap<Integer, String> intTree =
new <Integer, String> OrderedMap();
intTree.put(5, "A");
intTree.put(8, "B");
intTree.put(-3, "C");
intTree.put(4, "D");
System.out.println("\nMax key is " + intTree.maxKey());
Output
Max key is null
Max key is 8
