I need help writing an erase method for a Map ADT using a right-threaded binary search tree. Here is the header file:

This is what the erase method should look like:

An erase () method to remove an element from the Map. The method removes an existing node while maintaining the structure of the underlying threaded tree. This operation could be tricky to code, as you don't want to "break" the thread while removing a node. One approach to do this is to consider the following four cases of node removal: removing a node with no child links, with left child link only, with right child link only and two children links An erase () method to remove an element from the Map. The method removes an existing node while maintaining the structure of the underlying threaded tree. This operation could be tricky to code, as you don't want to "break" the thread while removing a node. One approach to do this is to consider the following four cases of node removal: removing a node with no child links, with left child link only, with right child link only and two children links