huffman(greedy)

present a file by binary character code,let the less characters can be presented simplier.

 package greedy;

 import java.util.Iterator;
 import java.util.LinkedList;

 public class huffman {
     private static class Node{
         private Node left ;
         private Node right ;
         private int freq;
         public Node(Node left,Node right,int freq){
             this.left = left;this.right = right; this.freq = freq;
         }
         }

     public Node Huffman(LinkedList<Node> list){
         int n = list.size();
         for(int i = 1;i <= n-1;i++){
             Node x = list.removeFirst();
             Node y = list.removeFirst();
             Node node = new Node(x,y,x.freq + y.freq);
             for (int j = 0;j < list.size() - 1;j++){
                 if(node.freq >= list.get(j).freq && node.freq <= list.get(j+1).freq){
                     list.add(j+1,node);
                 }
                 else if( j+1 == list.size() - 1){
                     list.addLast(node);
                 }

             }

         }
         return list.getFirst();

     }

 }