构造赫夫曼树的算法演示课件

上传人：猪*** IP属地：境外上传时间：2022-10-05 格式：PPT 页数：45 大小：1.59MB 积分：28 举报 版权申诉

已阅读5页，还剩40页未读，继续免费阅读

版权说明：本文档由用户提供并上传，收益归属内容提供方，若内容存在侵权，请进行举报或认领

文档简介

1、void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weig

2、ht=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示n=4W4=7,5,2,4void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;

3、HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示n=4W4=7,5,2,4void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n

4、+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w

5、) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 01234567weight parent lchild rchild构造赫夫曼树的算法演示n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if

6、(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示01234567weig

7、ht parent lchild rchildn=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i

8、; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 001234567weight parent lchild rchildn=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m;

9、 + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 0500001234567weight parent lchild rchildn=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return;

10、m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 05000200001234567weig

11、ht parent lchild rchildn=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i

12、; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 05000200001234567weight parent lchild rchildn=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; f

13、or(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 050002000400001234567weight parent lchild rchildn=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n)

14、if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 05000

15、20004000weight parent lchild rchild01234567n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.pa

16、rent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 05000200040000000weight parent lchild rchild01234567n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=

17、n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 050002000400000000000weight parent lchild rchild01234567n=4W4=7,5,2,4m=7void HuffmanC

18、oding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weigh

19、t+HTs2.weight; 构造赫夫曼树的算法演示70 0 050002000400000000000weight parent lchild rchild01234567n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+

20、1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 0500020004000000000000000weight parent lchild rchild01234567n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=

21、(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 0500020004000000000000000weight p

22、arent lchild rchild01234567n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.pare

23、nt=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 0500020004000000000000000weight parent lchild rchild01234567n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+

24、p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 0500020004000000000000000weight parent lchild rchild01234567n=4W4=7,5,2,4m=7void HuffmanCodin

25、g(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HT

26、s2.weight; 构造赫夫曼树的算法演示70 0 0500025004500000000000000weight parent lchild rchild01234567n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+

27、1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示70 0 0500025004500003000000000weight parent lchild rchild01234567n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=

28、(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild0123456770

29、0 0500025004500603400000000n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.pare

30、nt=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild0123456770 0 0500025004500603400000000n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+

31、p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild0123456770 0 0500025004500603400000000n=4W4=7,5,2,4m=7void HuffmanCodin

32、g(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HT

33、s2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild0123456770 0 0560025004500603400000000n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+

34、1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild0123456770 0 0560025004500663400000000n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=

35、(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild0123456770

36、0 0560025004500663400200000n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.pare

37、nt=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild0123456770 0 0560025004500663400250000n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+

38、p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild0123456770 0 05600250045006634110250000n=4W4=7,5,2,4m=7void HuffmanCodi

39、ng(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+H

40、Ts2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild0123456770 0 05600250045006634110250000n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=

41、n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild0123456770 0 05600250045006634110250000n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1;

42、HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild01234567

43、770 05600250045006634110250000n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.p

44、arent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild01234567770 05600250045006634117250000n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; +

45、i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight+HTs2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild01234567770 05600250045006634117250010n=4W4=7,5,2,4m=7void HuffmanCo

46、ding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; + i) select(HT, i-1, s1, s2); HTs1.parent=i;HTs2.parent=i; HTi.lchild=s1;HTi.rchild=s2; HTi.weight=HTs1.weight

47、+HTs2.weight; 构造赫夫曼树的算法演示weight parent lchild rchild01234567770 05600250045006634117250016n=4W4=7,5,2,4m=7void HuffmanCoding(HuffmanTree &HT,int *w,int n) if(n=1) return; m=2*n-1; HT=(HTNode*)malloc(m+1)*sizeof(HTNode); for(p=HT,i=1;i=n; + i,+p,+w) *p=*w,0,0,0; for(;i=m; + i, + p) *p= 0,0,0,0; for(i=n+1;i=m; +

人人文库> 全部分类> 行业资料 > 医学制药

温馨提示

1. 本站所有资源如无特殊说明，都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
2. 本站的文档不包含任何第三方提供的附件图纸等，如果需要附件，请联系上传者。文件的所有权益归上传用户所有。
3. 本站RAR压缩包中若带图纸，网页内容里面会有图纸预览，若没有图纸预览就没有图纸。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 人人文库网仅提供信息存储空间，仅对用户上传内容的表现方式做保护处理，对用户上传分享的文档内容本身不做任何修改或编辑，并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容，请与我们联系，我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

构造赫夫曼树的算法演示课件

文档简介

温馨提示

最新文档

评论

构造赫夫曼树的算法演示课件

文档简介

温馨提示

最新文档

评论

相关文档