求助有关哈夫曼树的问题!急!紧急
#include "iostream。h"
#include "string。h"
#define n 26
#define m 2*n-1
typedef struct
{
float weight;
int lchild, rchild,parent;
}HTNode;
typedef struct
{
char ch;
char bits[n+1];
}CodeNode;
typedef HTNode HuffmanTree[m];
typedef CodeNode HuffmanCode[n];
void InitHuffmanTree(HuffmanTree T)
{
int i...全部
#include "iostream。h"
#include "string。h"
#define n 26
#define m 2*n-1
typedef struct
{
float weight;
int lchild, rchild,parent;
}HTNode;
typedef struct
{
char ch;
char bits[n+1];
}CodeNode;
typedef HTNode HuffmanTree[m];
typedef CodeNode HuffmanCode[n];
void InitHuffmanTree(HuffmanTree T)
{
int i;
for(i=0;i>T[i]。
weight;
}
}
void SelectMin(HuffmanTree T,int r,int &x1,int &x2)
{
int i=0,j=0,x;
while(T[i]。
parent!=-1) i++;
while(T[j]。parent!=-1||i==j) j++;
x1=T[i]。weightT[j]。weight?i:j;
for(i=0;i>h[i]。
ch;
start=n;
c=i;
while((p=t[c]。parent)>=0)
{
cd[--start]=(t[p]。lchild==c)?'0':'1';
c=p;
}
strcpy(h[i]。
bits,&cd[start]);
}
for(i=0;i bits<收起