哈夫曼算法，功能完整。哈夫曼树是一种树形结构，用哈夫曼树的方法解编程题的算法就叫做哈夫曼算法。哈夫曼是一种数据结构，因为其存放方式颇有点象一棵树有树叉因而称为树。 -The Huffman algorithm, the functional integrity. Huffman tree is a tree structure, method of Huffman tree solution programming algorithm called Huffman algorithm. Huff

1、实现折半查找算法 2、实现二叉排序树的建立、查找和删除 -1, to achieve the bisearch algorithm 2, the establishment of two fork sort tree, find and delete

定义线索链表类型，实现线索二叉树的基本操作。-Define the list of clues to achieve the basic operation of the two fork tree.

定义二叉链表类型，实现二叉树的基本操作：建立、先中后序遍历、层次遍历及输出。-The definition of two fork list type, two fork tree to achieve the basic operation: the establishment, the first in the order traversal, hierarchical traversal and output.