求助：如何完整实现基于贪心算法的哈夫曼编码？

public class Huffman {

    Bintree tree;

    float weight;

    private Huffman(Bintree tt, float ww) {

        tree = tt;

        weight = ww;

    }

    public static Bintree huffmanTree(float[] f) {

        int n = f.length;

        Huffman[] w = new Huffman[n + 1];

        Bintree zero = new Bintree();

        for (int i = 0; i
            Bintree x = new Bintree();

            x.makeTree(new MyInteger(i), zero, zero);

            w[i + 1] = new Huffman(x, f[i]);

        }

        MinHeap H = new MinHeap();

        H.initialize(w, n);

        for (int i = 1; i
            Huffman x = (Huffman) H.removeMin();

            Huffman y = (Huffman) H.removeMin();

            Bintree z = new Bintree();

            z.makeTree(null, x.tree, y.tree);

            Huffman t = new Huffman(z, x.weight + y.weight);

            H.put(t);

        }

        return ((Huffman) H.removeMin()).tree;

    }