Answer to Question #290449 in C++ for Peter

Question

Map ADT using a binary search tree. The implementation must be a class template that has all the Map ADT functions:

• size() -- return number of entries
• empty() -- true if map empty, flase otherwise
• find(k) -- find the given key
• put(k, v) -- put key-value pair
• erase(k) -- erase by key
• erase(p) -- erase by iterator p
• begin() -- iterator to beginning
• end() -- iterator to the sentinel

Answer 1

Dear Peter, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order