Description: 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).
To Search:
File list (Check if you may need any files):
Trie_and_Huffman
Trie_and_Huffman\Huffman.h
Trie_and_Huffman\main.cpp
Trie_and_Huffman\Trie.h
Download