第06章 树与二叉树.pptVIP

* 存储结构(方案一) lchild data parent rchild weight (int) (int) (int) (int) typedef struct{ unsigned int weight; unsigned int parent; unsigned int lchild; unsigned int rchild; } HTNode,* HuffmanTree; HuffmanTree HT; weight parent lchild rchild weight parent lchild rchild HT 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 {5,29,7,8,14,23,3,11} 5 0 0 0 29 0 0 0 7 0 0 0 8 0 0 0 14 0 0 0 23 0 0 0 3 0 0 0 11 0 0 0 8 0 1 7 9 9 15 0 3 4 10 10 19 0 8 9 11 11 29 0 5 10 12 12 42 0 6 11 13 13 58 0 2 12 14 14 100 0 13 14 15 15 42 100 23 F 19 11 H 5 3 8 A G 7 8 15 14 29 29 58 B C D E 编码