構(gòu)造赫夫曼樹(shù)的算法演示課件_第1頁(yè)
構(gòu)造赫夫曼樹(shù)的算法演示課件_第2頁(yè)
構(gòu)造赫夫曼樹(shù)的算法演示課件_第3頁(yè)
構(gòu)造赫夫曼樹(shù)的算法演示課件_第4頁(yè)
構(gòu)造赫夫曼樹(shù)的算法演示課件_第5頁(yè)
已閱讀5頁(yè)，還剩40頁(yè)未讀， 繼續(xù)免費(fèi)閱讀

下載本文檔

版權(quán)說(shuō)明：本文檔由用戶提供并上傳，收益歸屬內(nèi)容提供方，若內(nèi)容存在侵權(quán)，請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)

文檔簡(jiǎn)介

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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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; 構(gòu)造赫夫曼樹(shù)的算法演示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. 本站所有資源如無(wú)特殊說(shuō)明，都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等，如果需要附件，請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
  • 3. 本站RAR壓縮包中若帶圖紙，網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽，若沒(méi)有圖紙預(yù)覽就沒(méi)有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間，僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理，對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯，并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容，請(qǐng)與我們聯(lián)系，我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。

最新文檔

評(píng)論

0/150

提交評(píng)論