This assignment is challenging. It will be worth two assignments: Assignment 08) will be graded as 20/20 (100%) when half of our assertions pass. Assignment 09) will be the percentage of the remaining half of our assertions passing.
Add the remove method to OrderedMap<K, V> to remove any node leaving the OrderedMap in order. Section on 19- or 20- April will discuss the algorithm provided here: BSTRemove.pdf
public V remove(K keyOfelementToRemove)
Remove must return null if the key is not found or the value being removed when that key is found.
OrderedMap<String, String> accounts = new OrderedMap<String, String>();
accounts.put("G", "Georgie");
assertNull(accounts.remove("Not here"));
assertEquals("Georgie", accounts.get("G"));
assertEquals("Georgie", accounts.remove("G"));
assertNull(accounts.get("G"));