Huffman

哈夫曼编码

package com.hpu.Huffman;
public class BinaryTree implements Comparable{
int key;
char data;
BinaryTree left;
BinaryTree right;
public BinaryTree(){}
public BinaryTree(int k,char d,BinaryTree l,BinaryTree r){
key=k;
data=d;
left=l;
right=r;
}
public String toString(){
return “character:”+data+" frequency:"+key;
}
public int compareTo(BinaryTree x) {
if (key > x.key)
return 1;
if (key < x.key)
return -1;
return 0;
}
public void inorderWalk(){//中序遍历
if(left!=null)
left.inorderWalk();
System.out.print(toString());
if(right!=null)
right.inorderWalk();
}
}

package com.hpu.Huffman;

import java.util.PriorityQueue;

public class Huffman {
public static BinaryTree huffman(int[] f,char[] d){
int i,n=f.length;
PriorityQueue Q=new PriorityQueue<>(n);
for(i=0;i<n;i++){
BinaryTree t=new BinaryTree(f[i],d[i],null,null);
Q.add(t);
}
for(i=0;i<n-1;i++){
BinaryTree x,y,z;
x=Q.poll();//从优先队列中弹出频数最小的元素赋值给x
y=Q.poll();//从优先队列中弹出频数最小的元素赋值给y
z=new BinaryTree(x.key+y.key,‘*’,x,y);
Q.add(z);//将z插入优先队列.
}
return Q.poll();
}
public static void printCode(BinaryTree t,String c) {
if(t.left!=null)//向左探索
printCode(t.left,c+“0”);
if(t.right!=null)//右
printCode(t.right,c+“1”);
if(t.leftnull&&t.rightnull)//叶子节点
System.out.println(t+" code"+c+" ");
}
}

package com.hpu.Huffman;

public class Test {
public static void main(String[] args) {
int f[]={45,13,12,16,9,5},i;
char d[]={‘a’,‘b’,‘c’,‘d’,‘e’,‘f’};
BinaryTree h=Huffman.huffman(f,d);
Huffman.printCode(h,“”);
System.out.println();
}
}

时间复杂度分析：
创建最小优先队列耗时O(n),从优先队列Q中卸载队首各耗时O(lgn),将新的树插入到队列中耗时O(lgn),for循环重复O(n）次，所以过程Huffman总耗时O(nlgn)。