哈夫曼编、译码器(8)

数据结构课程设计报告

while((L.List [i]<123&&L.List [i]>96)||L.List [i]==32) { GetCode(L.List[i],L); i++;

}

}

template

void HuaffmanTree::DeCode(LinkList L) { int i=0;

while(!qu.IsEmpty ()) { HuaffmanTreeNode *current=this->GetRoot (); while(current->GetData ()=='0') { if(qu.DeQueue()==0) current=current->GetLchild();

else

current=current->GetRchild(); }

cout<GetData ();

}

}

template

void HuaffmanTree::GetCharFrenquency (LinkList L) { HuaffmanTreeNode *current=L.GetHead()->GetNext(); while(current) { if(current->GetData()!='0')

{cout<GetData()<<\ \<GetKey()<GetNext(); }

}

template

void HuaffmanTree::ShowPriorText(LinkList L) {

int i=0;

3

5 数据结构课程设计报告

while((L.List [i]<123&&L.List [i]>96)||L.List [i]==32) { cout<

}

}

template

void HuaffmanTree::ShowNodeBit(LinkList L) { HuaffmanTreeNode *current=L.GetHead()->GetNext(); while(current) { if(current->GetData()!='0')

{cout<GetData ()<<\ \; GetCode(current->GetData(),L); cout<

current=current->GetNext();

}

}

template

int HuaffmanTree::GetHeight(HuaffmanTreeNode *p) { if(!p) return 0; int hl,hr;

hl=GetHeight(p->GetLchild()); hr=GetHeight(p->GetRchild()); return hl>hr?++hl:++hr;

}

3

6