a．HUFFMAN树及HUFFMAN编码

任务：由用户输入n个结点权值，建立HUFFMAN树并输出HUFFMAN编码。



b.二叉树建立及相关算法实现

任务：按照广义表表达法建立二叉树，并实现二叉树的层次、先序、中序与后序遍历，以及输出树中叶子结点的结点值及叶子结点的个数。（ 用递归或非递归的方法都可以）

要求能够输入树的各个结点，并能够输出用不同方法遍历的遍历序列；分别建立创建二叉树存储结构的的输入函数、输出层序遍历序列的函数、输出先序遍历序列的函数、输出后序遍历序列的函数以及输出叶子结点值和个数的函数。



C．排序算法的实现

任务：实现插入排序（直接插入排序、二分插入排序）、选择排序（直接选择排序、堆排序）、交换排序（冒泡排序、希尔排序）。

-a. HUFFMAN coding tree and HUFFMAN

Tasks: from user input n-node weights, the establishment of tree and output HUFFMAN coding HUFFMAN.



b. Tree-building and related algorithm

Tasks: generalized form in accordance with the establishment of the expression tree, and to achieve the level of binary tree, the first order, in sequence and after the traversal, as well as the output node tree leaf node value and the number of leaf nodes. (Using recursive or non-recursive method can be)

Request to enter the various tree nodes and different ways to traverse the output of the traversal sequence　were set up to create the binary tree structure of the input storage function, the output sequence traversal sequence function, the output first traversal sequence function, the output sequence after the traversal of the function and the output leaf node function value and number.



C. Sort Algorithm

Tasks: the achievement of Insertion Sort (direct insertion sort, binary insertion sort), selec