数据结构第六章实验

#include<iostream.h>#include<stdlib.h>#include<string.h>typedef struct{unsigned int weight;unsigned int parent,lchild,rchild;}HTNode,*HuffmanTree;typedef char * *HuffmanCode;/*void Select(HuffmanTree &HT,int n,int &s1,int &s2) {s1=1;int j;for(j=1;j<=n;j++){while(HT[j].parent==0){if(HT[s1].weight>HT[j].weight)s1=j;}}HT[s1].parent=1;if(s1!=1)s2=1;else s2=2;for( j=1;j<=n;j++){while(HT[j].parent==0){if(HT[s2].weight>HT[j].weight)s2=j;}}}错误，未查出原因*/int min(HuffmanTree t,int i){int j,flag;unsigned int k;for(j=1;j<=i;j++)if(t[j].weight<k&&t[j].parent==0)k=t[j].weight,flag=j;t[flag].parent=1;return flag;}void Select(HuffmanTree t,int i,int &s1,int &s2){ // s1为最小的两个值中序号小的那个int j;s1=min(t,i);s2=min(t,i);if(s1>s2){j=s1;s1=s2;s2=j;}}void HuffmanCoding(HuffmanTree &HT,HuffmanCode &HC,int *w,int n){ int m,i,start,t1,t2;unsigned int c,f;char *cd;if(n<=1){cout<<"Error!"<<endl;}m=2*n-1;HT=(HuffmanTree)malloc((m+1)*sizeof(HTNode));for(i=1;i<=n;i++){HT[i].weight=w[i-1];HT[i].parent=0;HT[i].lchild=0;HT[i].rchild=0;}for(;i<=m;i++)HT[i].parent=0;for(i=n+1;i<=m;++i){Select(HT,i-1,t1,t2);HT[t1].parent=i;HT[t2].parent=i;HT[i].lchild=t1;HT[i].rchild=t2;HT[i].weight=HT[t1].weight+HT[t2].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);}void main(){HuffmanTree HT;HuffmanCode HC;int i,n,*w;cout<<"请输入赫夫曼的字符个数:"<<endl;cin>>n;w=(int *)malloc(n*sizeof(int));cout<<"请输入赫夫曼字符权值："<<endl;for(i=0;i<n;i++){cin>>*(w+i);}cout<<"执行赫夫曼树和赫夫曼编码"<<endl;HuffmanCoding(HT,HC,w,n);cout<<"输出赫夫曼树储存数据："<<endl;for(i=1;i<=2*n-1;i++){cout<<HT[i].weight<<" "<<HT[i].parent<<" "<<HT[i].lchild<<" "<<HT[i].rchild<<endl;}cout<<"输出赫夫曼编码"<<endl;for(i=1;i<=n;i++){cout<<HC[i]<<endl;}}#include<iostream.h>#include<stdlib.h>#include<string.h>typedef struct{int weight;int parent,lchild,rchild;}HTNode,*HuffmanTree;typedef char * *HuffmanCode;typedef char *Huffman;void Select(HuffmanTree &HT,int n,int &s1,int &s2) {s1=1;s2=1;int j;for(j=1;j<=n;j++){while(!HT[j].parent){if(HT[s1].weight>HT[j].weight)s1=j;}}HT[s1].parent=1;for( j=1;j<=n;j++){while(!HT[j].parent){if(HT[s2].weight>HT[j].weight)s2=j;}}}void HuffmanCoding(HuffmanTree &HT,HuffmanCode &HC,int *w,int n){ int m,i,start,c,f,s1,s2;Huffman cd;HuffmanTree p;if(n<=1){cout<<"Error!"<<endl;exit(0);}m=2*n-1;HT=(HuffmanTree)malloc((m+1)*sizeof(HTNode));for(p=HT+1,i=1;i<=n;++i,++p,++w){p->weight=*w;p->parent=0;p->lchild=0;p->rchild=0;}for(;i<=m;++i,++p){p->weight=0;p->parent=0;p->lchild=0;p->rchild=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]);}}void main(){HuffmanTree HT;HuffmanCode HC;int i,n,*w,a[100]={0};w=a;cout<<"请输入赫夫曼的字符个数:"<<endl;cin>>n;cout<<endl<<"请输入赫夫曼字符："<<endl;for(i=0;i<n;i++){cin>>a[i];}cout<<endl<<"执行赫夫曼树和赫夫曼编码"<<endl;HuffmanCoding(HT,HC,w,n);cout<<endl<<"输出赫夫曼树储存数据："<<endl;for(i=1;i<=2*n-1;i++){cout<<HT[i].weight<<" "<<HT[i].parent<<" "<<HT[i].lchild<<" "<<HT[i].rchild<<endl;}cout<<"输出赫夫曼编码"<<endl;for(i=1;i<=n;i++){cout<<HC[i]<<endl;}}线索二叉树：#include <stdio.h>#include <malloc.h>typedef enum PointerTag {Link,Thread} ; /*指针标志*/typedef char DataType;typedef struct BiThreTree{ /*定义结点元素*/PointerTag LTag,RTag;DataType data;struct BiThreTree *lchild,*rchild;}BiThreTree;BiThreTree *pre; /*全局变量，用于二叉树的线索化*/ BiThreTree *CreateTree() /*按前序输入建立二叉树*/{BiThreTree *T;DataType ch;scanf("%c",&ch);if(ch=='#')T=NULL;else{T=(BiThreTree *)malloc(sizeof(BiThreTree));T->data=ch;T->LTag=Link; /*初始化时指针标志均为Link*/T->RTag=Link;T->lchild=CreateTree();T->rchild=CreateTree();}return T;}void InThread(BiThreTree *T){BiThreTree *p;p=T;if(p){InThread(p->lchild);if(!p->lchild){ p->LTag=Thread;p->lchild=pre;}if(!pre->rchild){ pre->RTag=Thread;pre->rchild=p;}pre=p;InThread(p->rchild);}}BiThreTree *InOrderThrTree(BiThreTree *T) /*中序线索化二叉树*/ {BiThreTree *Thre; /*Thre为头结点的指针*/Thre=(BiThreTree *)malloc(sizeof(BiThreTree));Thre->lchild=T;Thre->rchild=Thre;pre=Thre;InThread(T);pre->RTag=Thread;pre->rchild=Thre;Thre->rchild=pre;return Thre;}void InThrTravel(BiThreTree *Thre) /*中序遍历二叉树*/{BiThreTree *p;p=Thre->lchild;while(p!=Thre) /*指针回指向头结点时结束*/ {while(p->LTag==Link)p=p->lchild;printf("%4c",p->data);while(p->RTag==Thread&&p->rchild!=Thre){p=p->rchild;printf("%4c",p->data);}p=p->rchild;}}void main(){BiThreTree *T,*Thre;printf("PreOrder Create Binary Tree:\n");T=CreateTree();Thre=InOrderThrTree(T);printf("InOrder Traverse Binary Tree:\n");InThrTravel(Thre);}。