1. Implement the general Priority Queue ADT using the min-heap implemented as a vector. Instead of having the number of priority levels as an argument of the constructor, specify the maximum capacity of the queue.
2. Complete the implementation of the Morse Code Tree ADT.