C Sc 227 Practice Quiz 5 Name ________________________________ 50pts
1. Binary Tree Traversals. Use the following tree to write out the order of each of the three traversals (12pts)
A
C
B
D
E
F
I
G
H
Preorder traversal __________________________
Inorder traversal __________________________
Postorder traversal __________________________
2. Is this a Binary Search Tree (yes or no)? _______ (4pts)
M
R
G
G
X
H
3. Is this a Binary Search Tree (yes or no)? _______ (4pts)
M
H
R
X
G
Q
For the final two questions of this practice quiz, add the methods as if they are in the following
OrderedMap<K,V> class. Remember that OrderedMap has an instance variable named root to reference
the root of the OrderedMap object and it uses the MapNode class.
// This heading ensures that the key implements Comparable so you can use the
// compareTo method on the key. If type K does not, the compiler complains.
public class OrderedMap<K extends Comparable<K>, V> {
private class MapNode {
private K key;
private V value;
private MapNode left;
private MapNode right;
public MapNode(K theKey, V theValue) {
key = theKey;
value = theValue;
left = null;
right = null;
}
} // end class MapNode
private MapNode root;
public OrderedMap() { // Create an empty tree
root = null;
}
// …
}
