Help Tank find Morpheus and the others in The Matrix by creating a dictionary to automate the deciphering of known symbols in code!
Real world matrix: Why does sorting characters work in a BST? What would the binary encoding of your text file look like?
Your tasks are:
1.to write the MyMap functions
2.to write a function, getletterfrequency(), that accepts an arbitrary number of characters from standard input and builds a MyMap containing the number of occurrences for each character in the input, i.e., if the letter 'a' occurs 43 times in the input, map['a'] should return 43. An example of the behavior of this function is at the end of pa06.cpp, which expects \< sample_input.txt
You will implement a dictionary (abstract data type) using a binary search tree data structure that will have similar functionality to std::map.
https://en.cppreference.com/w/cpp/container/map