Question: Implement a map, which is an abstract data structure that stores a collection of (key, value) pairs. Your implementation should at least support the following
Implement a map, which is an abstract data structure that stores a collection of (key, value) pairs. Your implementation should at least support the following operations:
+ initialize the map+ get the size of the map
+ insert a pair (key, value) into the map+ get the value for a given key
+ remove the pair from the map with a given key
Please include your test cases in the code.
In Haskell
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
