Before you keep reading...

Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.

Support Runestone Academy Today

Before you keep reading...

Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.

Support Runestone Academy Today

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 None otherwise.

• del deletes the key–value pair from the map using a statement of the form del map[key].

• size() returns the number of key–value pairs stored in the map.

• in return True for a statement of the form key in map if the given key is in the map, False otherwise.

You have attempted of activities on this page