6.13. Search Tree Operations¶
Before we look at the implementation, let’s review the interface provided by the map ADT. You will notice that this interface is very similar to the Python dictionary.
Map()creates a new empty map.
put(key, val)adds a new key–value pair to the map. If the key is already in the map, it replaces the old value with the new value.
get(key)takes a key and returns the matching value stored in the map or
deldeletes the key–value pair from the map using a statement of the form
size()returns the number of key–value pairs stored in the map.
Truefor a statement of the form
key in mapif the given key is in the map,