java哈夫曼树实例代码_java

本文实例为大家分享了哈夫曼树java代码，供大家参考，具体内容如下

package boom;

import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Queue;

class Node<T> implements Comparable<Node<T>>{
  private T data;
  private int weight;
  private Node<T> left;
  private Node<T> right;

  public Node (T data,int weight){
    this.data = data;
    this.weight = weight;
  }

  public int compareTo(Node<T> other) {
    if(this.weight > other.getWeight()){
      return -1;
    }if(this.weight < other.getWeight()){
      return 1;
    }
    return 0;
  }

  public T getData() {
    return data;
  }

  public void setData(T data) {
    this.data = data;
  }

  public int getWeight() {
    return weight;
  }

  public void setWeight(int weight) {
    this.weight = weight;
  }

  public Node<T> getLeft() {
    return left;
  }

  public void setLeft(Node<T> left) {
    this.left = left;
  }

  public Node<T> getRight() {
    return right;
  }

  public void setRight(Node<T> right) {
    this.right = right;
  }  

  public String toString(){
    return "data:"+this.data+";weight:"+this.weight;
  }
}

public class huffuman<T> {
  static <T> Node<T> create(List<Node<T>> nodes){
    while(nodes.size()>1){
      Collections.sort(nodes);
      Node<T> left = nodes.get(nodes.size()-1);
      Node<T> right = nodes.get(nodes.size()-2);
      Node<T> parent = new Node<T>(null,left.getWeight()+right.getWeight());
      parent.setRight(right);
      parent.setLeft(left);
      nodes.remove(left);
      nodes.remove(right);
      nodes.add(parent);
    }
    return nodes.get(0);
  }
  static<T> List<Node<T>> breadth(Node<T> root){
    List<Node<T>> list = new ArrayList<Node<T>>();
    Queue<Node<T>> queue = new ArrayDeque<Node<T>>();
    queue.offer(root);
    while(queue.size()>0){
      Node<T> out = queue.poll();
      list.add(out);
      if(out.getLeft()!=null){
        queue.offer(out.getLeft());
      }
      if(out.getRight()!=null){
        queue.offer(out.getRight());
      }
    }
    return list;
  }
  public static void main(String[] args) {
    // TODO Auto-generated method stub
    List<Node<String>> list = new ArrayList<Node<String>>();
    list.add(new Node<String>("a",7));
    list.add(new Node<String>("b",5));
    list.add(new Node<String>("c",4));
    list.add(new Node<String>("d",2)); 

    Node<String> root =huffuman.create(list);
    System.out.println(huffuman.breadth(root));
//   System.out.println(list);
  }

}

以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持。

以上是小编为您精心准备的的内容，在的博客、问答、公众号、人物、课程等栏目也有的相关内容，欢迎继续使用右上角搜索按钮进行搜索java
哈夫曼树
java实例代码、java多线程实例代码、java面向对象代码实例、java源代码实例、java经典实例 源代码，以便于您获取更多的相关知识。