Introduction - If you have any usage issues, please Google them yourself
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