1. Devise a sequential representation for Huffman coding trees suitable for use as part of a file compression utility (see Project 5.7).
2. Write classes that implement the general tree class declarations of Figure 6.2 using the dynamic "left-child/right-sibling" representation described in Section 6.3.4.
