数据结构-课件-ly树代码

}}#include<iostream>#include<cstdio>#include<cmath>usingnamespacestd;#defineMAX_LEN100voidgotoxy(intx,intCOORDc.X=x-c.Y=y-}typedefstructHuffmanTreeNode{intdata;HuffmanTreeNode*parent,*lChild,*rChild;charcode[MAX_LEN];this->parent=this->lChild=this->rChild=}intgetHeight(HuffmanTreeT){if(T==NULL){returnintlh=getHeight(T->lChild);intrh=getHeight(T->rChild);if(lh>=rh){returnlh+returnrh+}}}voidprint(HuffmanTreeT,intheight,intcurHeight,intleftPos){inty=curHeight;intx=leftPos;if(T!=cout<<T->datainttemp=pow(2,height-curHeight-cout<<}}voidprint(HuffmanTreeT){inth=getHeight(T);intleftPos=pow(2,h-1);}voidGetHuffmanTree(HuffmanTree*HT,int*w,intn){if(n<1)return;intm=2*n-*HT=newHuffmanTreeNode[m+1];HuffmanTreeNode*p=*HT+1;for(inti=1;i<=n;i++){(*p).data=}for(int//在[1~i-1]ints1Pos,s2Pos;intcount=for(intj=1;j<=i-1;j++){if((*HT)[j].parent!=NULL){}if(count==1){s1=&(*HT)[j];s1Pos=j; if(count==2){s2=&(*HT)[j];s2Pos=j;if(s2->data<s1->data){HuffmanTreeNode*temp=s1;s1=s2;s2=temp;intt=s1Pos;s1Pos=s2Pos;s2Pos=t;}intdata=}}if(data<s1->data){s2=s1;s1=s2Pos=s1Pos;s1Pos=j;}elseif(data<s2->data){s2=&(*HT)[j];s2Pos=j;}}}if(s2Pos //intt=s2Pos;s2Pos=s1Pos;s1Pos=t;}s1=&(*HT)[s1Pos];s2=//(*HT)[i].data=s1->data+s2->data;s1->parent=s2->parent=&(*HT)[i];(*HT)[i].lChild=s1;(*HT)[i].rChild=}}voidsetHuffmanCode(HuffmanTreeT,intcurLen){if(T==NULL){}HuffmanTreeNode*p=T->parent;if(p!=NULL){for(int}if(T==p-}//cout<<T->data<<""<<T->code<<}intintn;cin>>n;intfor(inti=0;i<n;i++)cin>>w[