package src.test.java;import java.util.PriorityQueue;// 定义哈夫曼树节点类class HuffmanNode implements Comparable<HuffmanNode> {int weight; // 权值HuffmanNode left; // 左子节点HuffmanNode right; // 右子节点public HuffmanNode(int weight) {this.weight = weight;}// 实现Comparable接口,用于PriorityQ...
叶子节点的初始化72{73HT[i].weight =0;74HT[i].parent =0;75HT[i].lchild =0;76HT[i].rchild =0;77}7879cout<<"构造的哈夫曼树如下:\n";80for(inti=n+1;i<=m;i++)//填充n+1-m之间节点的信息81{82//在HT[1]-HT[i-1]的范围内选择两个parent为0且weight最小的两个节点,其序号分别...