使用优先队列实现Huffman树

package com.mmall.common.Test;

import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Queue;

/**
 * Created by Workstation on 2017/8/9.
 */
public class HuffmanCode {

   private class HuffNode implements Comparable<HuffNode>
    {
        HuffNode Left;
        HuffNode Right;
        int val;

        public HuffNode (HuffNode left, HuffNode right, int val) {
            Left = left;
            Right = right;
            this.val = val;
        }

        @Override
        public int compareTo (HuffNode o) {
            return this.val-o.val;
        }
    }




    public void CreateHuffmanTree(int [] weight)
    {
        //创建一个优先的队列;其中的值按照最小堆方式创建
        PriorityQueue<HuffNode> priorityQueue=new PriorityQueue<HuffNode> ();


        for(int i=0;i<weight.length;i++)
        {
            HuffNode node=new HuffNode (null,null,weight[i]);
            priorityQueue.add(node);
        }

        HuffNode node1=null;// 最小权值点
        HuffNode node2=null;// 次最小权值点
        HuffNode node3=null;//合并的值

        for(int j=0;j<weight.length-1;j++)
        {
            node1=priorityQueue.poll ();
            node2=priorityQueue.poll ();
            node3=new HuffNode (node1,node2,node1.val+node2.val);
            priorityQueue.offer(node3);
        }

        System.out.println(priorityQueue.peek ().val);
    }
}