The pendant property of tree branches is checked and the order of tree branches is determined step by step, then the lineartree is realized.
它通过判断树支的边缘性质，逐个确定树支的排序，从而实现线形树。
2
Summary of design: the procedures used by the data structure is lineartree and table, the algorithm used by the main sculpture, in order Huffman algorithm.
概要设计：本程序所使用的数据结构是树和线性表，所使用的算法主要有堆排序、赫夫曼算法。
3
The first potential future change would modify the unacknowledged packet list so that it is organized with an index as a red-black tree instead of the current linear list.