Description: Construct the Huffman tree/// /// /// /// to generate Huffman tree// weight s array// n weights array length// NewTree weight new Huffman tree generated void createHFMTree (int* weights, int n, BinaryTree <int> & NewTree) {//initialize heap MinHeap <BinaryTree<int> > Heap (n) int i = 0 for ( i <n i++){
heap.Insert(BinaryTree<int> (Weights [i])) }// Select heap root smaller value of the two trees, and then inserted into the pile to form a new tree and two trees removed from the pile
To Search:
File list (Check if you may need any files):
huffmancode.c
Download