树——Huffman树

Human树又称最优树，可以用来构造最优编码，用于信息传输、数据压缩等。

---

1.二叉编码树

---

2.Huffman树及Huffman编码

/**
 * 
 * Huffman树结点定义
 *
 */
public class HuffmanTreeNode extends BinTreeNode {
    public int weight;//权值
    private String coding = "";//编码

    //构造方法
    public HuffmanTreeNode(int weight) {
        this(weight,null);
    }

    public HuffmanTreeNode(int weight, Object e) {
        super(e);
        this.weight = weight;
    }

    //改写父类方法
    public HuffmanTreeNode getParent(){
        return (HuffmanTreeNode)super.getParent();
    }
    public HuffmanTreeNode getLChild(){
        return (HuffmanTreeNode)super.getLChild();
    }
    public HuffmanTreeNode getRChild(){
        return (HuffmanTreeNode)super.getRChild();
    }

    public int getWeight() {
        return weight;
    }
    public String getCoding() {
        return coding;
    }
    public void setCoding(String coding) {
        this.coding = coding;
    }
}

//通过结点数组生成Huffman树
private static HuffmanTreeNode buildHuffmanTree(HuffmanTreeNode[] nodes) {
    int n = nodes.length;
    if(n<2){
        return nodes[0];
    }
    List l = new ListArray();//根节点线性表，按weight从大到小有序
    for(int i=0;i<n;i++){//将结点逐一插入线性表
        insertToList(l,nodes[i]);
    }
    for(int i=1;i<n;i++){//选择weight最小的两棵树合并，循环n-1次
        HuffmanTreeNode min1 = (HuffmanTreeNode) l.remove(l.getSize()-1);
        HuffmanTreeNode min2 = (HuffmanTreeNode) l.remove(l.getSize()-1);
        HuffmanTreeNode newRoot = new HuffmanTreeNode(min1.getWeight()+min2.getWeight());
        newRoot.setLChild(min1);
        newRoot.setRChild(min2);
        insertToList(l, new Root());//新树插入线性表
    }
    return (HuffmanTreeNode) l.get(0);//返回Huffman树的根
}
//将结点按weight从大到小的顺序插入线性表
private static void insertToList(List l, HuffmanTreeNode node) {
    for(int j=0;j<l.getSize();j++){
        if(node.getWeight() > ((HuffmanTreeNode)l.get(j)).getWeight()){
            l.insert(j, node);
            return;
        }
        l.insert(l.getSize(),node);
    }
}

//递归生成Huffman树
private static void generateHuffmanCode(HuffmanTreeNode root) {
    if(root == null){
        return;
    }
    if(root.hasParent()){
        if(root.isLChild()){
            root.setCoding(root.getParent().getCoding() + "0");//向左为0
        }else{
            root.setCoding(root.getParent().getCoding() + "1");//向右为1
        }
    }
    generateHuffmanCode(root.getLChild());
    generateHuffmanCode(root.getRChild());
}