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

易语言树型框加入分组数据源码例程程序结合易语言扩展界面支持库和数据结构支持库，实现树型框动态加入分组数据。 -Easy language tree box to add packet data source routine procedures combined with easy language extensions interface support library and data structure support library, the tree box to dynamic

通过文本方式储存与读取树型数据，数据无加密，可通过添加加密代码实现(Storing and reading tree data in text mode, the data is not encrypted, and can be realized by adding encryption code)

易语言代码实现部分数据结构源码，包含堆排序，快速排序，归并排序，小根堆，大根堆，树，栈等(Easy language code part data structure source code, including heap sort, quick sort, merge sort, heap min, Gen, tree, stack etc.)