1 建立二叉树 1）通过输入树的嵌套括号表示序列 2）根据前序遍历序列和中序遍历序列建立二叉树 3）建立哈夫曼树 2. 对于1中1），2）所建立的树进行如下操作： 1）查找结点 2）前序遍历 3）中序遍历 3 对于建立的哈夫曼树进行编码 4 输出二叉树的形状-1 Create a binary 1) by entering the sequence of the tree of nested brackets 2) According to the preorder traversal sequence and in the establishment of a binary tree traversal sequence 3) the establishment of the Huffman tree 2. For 1 1), 2) the establishment of tree do the following: 1) Find node 2) pre-order traversal 3) traversing the Huffman tree for the establishment of 3 to 4 output binary shape coding