数据结构之基于Java的最优二叉树实现

本文的代码来自于《数据结构与算法（JAVA语言版）》，是笔者在网上找到的资料，非正式出刊版物。笔者对代码一些比较难以理解的部分添加了注释和图解，欢迎大家来讨论。

import dsa.adt.BinaryTreeLinked;

public class HuffmanTreeLinked extends BinaryTreeLinked {
    public HuffmanTreeLinked(HuffmanTreeNode[] nodes) {
        this(nodes,new DefaultStrategy());

    }
    public HuffmanTreeLinked(HuffmanTreeNode[] nodes, Strategy strategy){
        super(buildHuffmanTree(nodes),strategy);
        generateHuffmanCode((HuffmanTreeNode)super.getRoot());
    }

    //返回Huffman的所有叶子结点
    public Iterator getAllLeafs(){
        LinkedList list = new LinkedListDLNode();
        getLeafs(getRoot(),list);
        return list.elements();
    }
    private void getLeafs(HuffmanTreeNode root, LinkedList list){
        if (root==null) return;
        if (root.isLeaf()) list.insertLast(root);
        getLeafs(root.getLChild(),list);
        getLeafs(root.getRChild(),list);
    }

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

    //通过结点数组生成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);//选择weight最小的树
            HuffmanTreeNode min2 = (HuffmanTreeNode)l.remove(l.getSize()-1);//选择weight次小的树
            HuffmanTreeNode newRoot = new HuffmanTreeNode(min1.getWeight()+min2.getWeight());//合并
            newRoot.setLChild(min1);
            newRoot.setRChild(min2);
            insertToList(l,newRoot);//新树插入线性表
        }
        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);
    }

    public HuffmanTreeNode getRoot(){
        return (HuffmanTreeNode)super.getRoot();
    }
}

---

package dsa.adt;

import dsa.adt.BinTreeNode;

public class HuffmanTreeNode extends BinTreeNode {
    private 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();
    }
    //get&set方法
    public int getWeight(){ return weight;}
    public String getCoding(){ return coding;}
    public void setCoding(String coding){ this.coding = coding;}    
}

---

public interface Strategy {
    //判断两个数据元素是否相等
    public boolean equal(Object obj1, Object obj2);

    /**
     * 比较两个数据元素的大小
     * 如果obj1 < obj2 返回-1
     * 如果obj1 = obj2 返回0
     * 如果obj1 > obj2 返回1
     */
    public int compare(Object obj1, Object obj2);
}

---

public final class DefaultStrategy implements Strategy 
{

    public boolean equal(Object obj1, Object obj2) 
    {
        return obj1.toString().equals(obj2.toString());
    }


    public int compare(Object obj1, Object obj2)
    {
        int comp = obj1.toString().compareTo(obj2.toString());
        if (comp==0) return 0;
        else if (comp>0) return 1;
        else return -1;
    }
}