implement the class E3ST from figure 5.14 – 5.18 in section 5.4 p. 171-178 in You”…

7.' 71 1. implement the class E3ST from figure 5.14 – 5.18 in section 5.4 p. 171-178 in You"- textbook. ation to create a city datab 'fi t. ns on question 5.3 P ase as a BST according to speci ca 5 3 .200 in Li.- implement
2.Implement the class MaxHeap from figure 5.19 in section 5.5 p.180 in your textbook. Use this imple-mentation to create a priority queue based on the MaxHeap class according to specifications on uestion q
5.5 p.200 in the textbook.
in your 3. Complete the implementation of the Huffman coding tree fig 5.27-5.29 p.190-191 in section 5.6 textbook, according to specifications of question 5.7 on p.201 in textbook.
_r P m„ I T1V