m.txt

严版数据结构。二叉树。功能齐全。经过调试。没有b+b_ 树。（c语言）。

 int s1,s2;
void Select(HuffmanTree HT,int x)
{ int i,j,t;
  s1=1;
  for(i=1;i<=t;i++)
  {if(HT[i].weight<=HT[s1].weight&&HT[i].parent==0)
   s1=i;
  }
  if(s1==1)
  {s2=2;
  for(j=2;j<=t;j++)
  {if(HT[j].weight<=HT[s1].weight&&HT[j].parent==0)
   s2=j;
  }
  }
  else
  {s2=1;
   for(j=1;j<=t&&j!=s1;j++)
   {if(HT[j].weight<=HT[s1].weight&&HT[j].parent==0)
   s2=j;
   
   }
  }
  if(s1>=s2) {t=s1;s1=s2;s2=t;}
}

void HuffmanCoding(HuffmanTree &HT,int *w,int n)
//构造赫夫曼树HT，并求赫夫曼编码HC
{ HuffmanCode HC;
  int m,i,start,c,f;
  HuffmanTree p;
  char *cd;
  if(n<1) printf("ERROR!\n");
  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[i];
   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);
  HT[s1].parent=i;HT[s2].parent=i;
  HT[i].lchild=s1;HT[i].rchild=s2;
  HT[i].parent=HT[s1].parent+HT[s2].parent;
 }

 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 menuhuff()
{char c;HuffmanTree HT,p;
int n;
int i;int w[50];

 for(i=1;i<=8;i++)
	 scanf("%d",&w[i]);
 n=8;

}


case 1: ;break;
void menuhuff();

void Select(HuffmanTree HT,int i,int s1,int s2);

void HuffmanCoding(HuffmanTree &HT,int *w,int n);

 if(&b[k1]>&b[k2])
   {t=k1;k1=k2;k2=t;}