代码以及测试程序如下
package
dateStructer.tree.huffmanTree;
import
java.util.ArrayDeque;
import
java.util.ArrayList;
import
java.util.List;
import
java.util.Queue;
/**
* 哈夫曼树
*
*
@author
liuyan
*/
public
class
HuffmanTree {
/**
* 节点实体
*/
public
static
class
Node<T> {
// 数据
T
data
;
// 权重
int
power
;
Node<T>
leftNode
;
Node<T>
rightNode
;
public
Node(T data,
int
power) {
this
.
data
= data;
this
.
power
= power;
}
@Override
public
String toString() {
//
TODO
Auto-generated method stub
return
"[data:"
+
data
+
" power:"
+
power
+
"]"
;
}
@SuppressWarnings
(
"unchecked"
)
public
boolean
compareTo(Node node) {
3
/
6