Function 1: Use a tree structure to implement our word counting function - Trie Trees: Function 2: The Huffman tree is encoded Program entry: The first line is a positive integer n, which represents the total number of words entered. The next n lines, each line of a word, the word by no more than 10 small letters written in English letters. The next line is a positive integer m, indicating the number of queries. The next m rows, each line of a number and a query, when the number is 1, the query for the word, the output of the word appears (can be 0); when the number 2, the query for Huffman coding, the corresponding output The word (the Huffman code corresponds to the word that exists).

Trie_and_Huffman
Trie_and_Huffman\Huffman.h
Trie_and_Huffman\main.cpp
Trie_and_Huffman\Trie.h

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．