【数据结构】哈夫曼树

模板

#include <bits/stdc++.h>
#include<cstdio>
#include<iostream>
#include <cmath>
#include <cstring>
using namespace std;

struct ElemType{
	int weight;//假定权值为整数
	int parent,lchild,rchild;//游标 
};

class HuffmanTree{
	public:
		HuffmanTree(int w[],int n);
		HuffmanTree();
		void print();
	private:
		ElemType *huffTree;
		int num;
		void Select(int n,int &i1,int &i2);
};

//和并查集差不多，i2是最小值，i1是次小值 
void HuffmanTree::Select(int n,int &i1,int &i2){
	int temp,i;
	for(i=0;i<n;i++)
		if(huffTree[i].parent==-1){
			i1=i;break;
		}
	for(i=i+1;i<n;i++)
		if(huffTree[i].parent==-1){
			i2=i;break;
		}
	if(huffTree[i1].weight>huffTree[i2].weight){
		swap(i1,i2);
	}
	for(i=i+1;i<n;i++){
		if(huffTree[i].parent==-1){
			if(huffTree[i].weight<huffTree[i1].weight){
				i2=i1,i1=i;
			}else if(huffTree[i].weight<huffTree[i2].weight){
				i2=i;
			}
		}
	}
}

HuffmanTree::HuffmanTree(int w[],int n){
	int i,k,i1,i2;
	huffTree=new ElemType[2*n-1];
	num=n;
	for(i=0;i<2*num-1;i++){
		huffTree[i].parent=-1;
		huffTree[i].lchild=huffTree[i].rchild=-1;
	}
	for(i=0;i<num;i++)
		huffTree[i].weight=w[i];
	for(k=n;k<2*num-1;k++){
		Select(k,i1,i2);
		huffTree[k].weight=huffTree[i1].weight+huffTree[i2].weight;
		huffTree[i1].parent=k;huffTree[i2].parent=k;
		huffTree[k].lchild=i1;huffTree[k].rchild=i2;
	}
}

void HuffmanTree::print(){
	int i,k;
	cout<<"每个叶子到根结点的路径是："<<endl;
	for(i=0;i<num;i++){
		cout<<huffTree[i].weight;
		k=huffTree[i].parent;
		while(k!=-1){
			cout<<"-->"<<huffTree[k].weight;
			k=huffTree[k].parent;
		}
		cout<<endl;
	}	
}

int main(){
	int w[]={2,3,4,5};
	HuffmanTree T(w,4);
	T.print();
	return 0;
}