主要介绍线性结构,树型结构,图状结构三种逻辑结构元素的存储实现,在此基础上介绍一些典型算法及时,空效率分析.-Introduces the linear structure, tree structure, graph-like structure of three elements of the logical structure of the storage to achieve, on this basis are some typical algorithms in time, spac

根据哈夫曼算法，建立哈夫曼树时，可以将哈夫曼树定义为一个结构型的一维数组HuffTree，保存哈夫曼树中各结点的信息，每个结点包括：权值、左孩子、右孩子、双亲-Huffman algorithm Huffman tree is created, the Huffman tree is defined as a structure of one-dimensional array HuffTree, save the information of Huffman tree nodes, each