Question

数据结构，哈夫曼编码问题，求大神！！！

#include<iostream.h>
#include<string>
#define n 8
#define m 15
typedef char *HuffmanCode;
typedef struct HTNODE{
int weight;
int parent;
int lchild;
int rchild;
};
typedef HTNODE HuffmanT[m];
void InitHT(HuffmanT T)
{
int i;
int a[8]={5,29,7,8,14,23,3,11};
for(i=1;i<=n;i++)
{
T[i].weight=a[i-1];
T[i].parent=-1;
T[i].lchild=-1;
}
for(i=n+1;i<=m;i++)
{
T[i].parent=-1;
T[i].lchild=-1;
T[i].rchild=-1;
T[i].rchild=-1;
}
}

void SelectMin(HuffmanT T,int x,int &p1,int &p2)
{
int i,j;
for(i=1;i<=x;i++)
{
if(T[i].parent==-1){p1=j;break;}
for(j=i+1;j<=x;j++)
{
if(T[j].parent==-1)
{
p2=j;
break;
}
}
}
for(i=1;i<=x;i++)
{
if((T[p1].weight>T[i].weight)&&(T[i].parent==-1)&&(p2!=i))
p1=i;
}
for(j=1;j<=x;j++)
{
if((T[p2].weight>T[j].weight)&&(T[j].parent==-1)&&(p1!=j))
p2=j;
}
}

void CreatHT(HuffmanT &T)
{
int i,p1,p2;
InitHT(T);
for(i=n;i<=m;i++)
{
SelectMin(T,i-1,p1,p2);
T[p1].parent=T[p2].parent=i;
T[i].lchild=p1;
T[i].rchild=p2;
T[i].weight=T[p1].weight+T[p2].weight;
}
}

void HuffmanTCode(HuffmanT T,HuffmanCode *hc)
{
int i;
char *cd=new char[n];
cd[n-1]='\0';
for(i=1;i<=n;i++)
{
int start=n-1;
int c,f;
for(c=i,f=T[i].parent;f!=-1;c=f,f=T[f].parent)
{
if(T[f].parent==c)
cd[--start]=0;
else
cd[--start]=1;
}
hc[i]=new char[n - start];
strcpy(hc[i],&cd[start]);
}
delete[] cd;
cout<<"哈夫曼编码为:";
for(i=1;i<=n;i++)
cout<<"the Huffman code of"<<T[i].weight<<"is"<<hc[i]<<endl;
}

void main()
{
HuffmanT ht;
HuffmanCode hc;
CreatHT(ht);
HuffmanTCode(ht,&hc);
}
编译没错误，运行直接报错，求解答，本人菜鸟。。。。

Answer 1

SelectMin 函数中的变量j没有初始化。