Description: A Huffman encoding and decoding procedures for a master tree, forests and the concept of binary trees and their characteristics and how the mutual conversion between them, and understand the three kinds of binary tree traversal: preorder traversal, in order traversal and postorder traversal, and the two kinds of tree traversal: preorder traversal and postorder traversal. 2, understanding the basic binary tree computing algorithm and its computing algorithm and the level of non-recursive traversal algorithm to find clues of a binary tree, and other applications. 3, master of several trees and binary storage structure as well as its construction, learn to use two forks to achieve binary linked list of storage verification and design-related algorithms.
To Search:
File list (Check if you may need any files):
哈弗曼树\Huffman.c
........\input.txt
........\output.txt
........\Huffman.exe
........\哈夫曼编(译)码实验方案.doc
........\哈夫曼编(译)码实验报告.doc
哈弗曼树
Download