数据结构4--树与二叉树.ppt课件.pptVIP

;;结点结构;-;;线索化二叉树;void InThreading ( BiThrTree p ) { if ( p ) { InThreading ( p - lchild ) ; if ( !p-lchild ) {p-LTag=Thread ; p-lchild=pre ; } if ( !pre-rchild ) {pre-RTag=Thread ;pre-rchild=p; } pre = p ; InThreading ( p - rchild ) ; } };例：求中序线索树中给定结点的后继结点 BiThrTree inordernext ( BiThrTree p ) { if ( p-RTag == Thread ) return ( p-rchild ) ; else { q = p-rchild ; while ( q-LTag==Link ) q = q-lchild ; return ( q ) ; } };6.6 赫夫曼(Huffman)树及其应用;最优二叉树或Huffman树——设有n个权值w1 w2 …… wn ，构造一棵有n个叶子结点的二叉树，每个叶子的权值为wi,则wpl最小的那棵二叉树叫最优二叉树或Huffman树.;例有4个结点,权值分别为7,5,2,4,构造有4个叶子结点的二叉树;例：将百分制成绩转换成5级分制成绩;;;;;;;一棵n个叶??结点的Huffman树共有2n-1个结点;void HuffmanCoding(HuffmanTree HT,HuffmanCode HC,int *w,int n ) { if ( n = 1 ) return ; m = 2 * n – 1 ; HT=(HuffmanTree) 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); HT[s1].parent=i;HT[s2].parent=i; HT[i].lchild=s1;HT[i].rchild=s2 ; HT[i].weight=HT[s1].weight+ HT[s2].weight; }; HC = ( HuffmanCode ) malloc ( ( n + 1 ) * sizeof ( char * ) ) ; cd = ( char * ) malloc ( n * sizeof ( char ) ) ; cd [ n – 1 ] = ‘\0’ ; for ( i = 1 ; i = n ; ++ i ) { start = n – 1 ; for ( c = i , f = HT[ i ].parent ; f != 0 ; c = f , f = HT [ f ] .parent ) if ( HT [ f ] . lchild == c ) cd [ -- start ] = ‘0’ ; else cd [ --start ] = ‘1’ ; HC [ i ] = ( char * ) malloc ( ( n – start ) * sizeof ( char ) ) ; strcpy ( HC [ i ] , cd [ start ] ) ; } free ( cd ) ; };HT