构造哈夫曼树,然后输出它树的中序序列。
从小到大的顺序给出词频(不超过10个),根据词频构造哈夫曼树。
为确保构建的哈夫曼树唯一,本题做如下限定:
(1)选择根结点权值最小的两棵二叉树时,选取权值较小者作为左子树。
(2)若多棵二叉树根结点权值相等,按先后次序分左右,先出现的作为左子树,后出现的作为右子树。如1 2 3,1与2合并后结点值也为3,3与3又会合并成一个结点6,则原来的3为其左子树,新合成的3为其右子树。
输入格式:
第一行输入词频个数;
第二行按从小到大的顺序输入每个词频
输出格式:
输出中序序列,中间以一个空格隔开
输入样例:
3
1 1 2
输出样例:
2 4 1 2 1
代码实现:
#include<iostream>
using namespace std;
typedef struct Hfnode {
int data;
struct Hfnode *Lson, *Rson, *next;
}Hfnode, *Hfptr;
Hfptr initiation(int w[], int n) {
Hfptr head = new Hfnode;
head->data = 0;
head->Lson = NULL;
head->Rson = NULL;
head->next = NULL;
Hfptr p = head;
for (int i = 0; i < n; ++i) {
Hfptr temp = new Hfnode;
temp->data = w[i];
temp->Lson = NULL;
temp->Rson = NULL;
temp->next = NULL;
p->next = temp;
p = temp;
}
return head;
}
Hfptr creatHftree(Hfptr head, int n) {
int i;
Hfptr qre, q, r, t1, t2;
for (i = 1; i < n; ++i) {
r = new Hfnode;
t1 = head->next;
t2 = t1->next;
r->data = t1->data + t2->data;
r->Lson = t1;
r->Rson = t2;
head->next = t2->next;
qre = head;
q = qre->next;
while (q != NULL && q->data <= r->data) {
qre = q;
q = q->next;
}
r->next = q;
qre->next = r;
}
return r;
}
void inorder(Hfptr p) {
if (p == NULL) return;
inorder(p->Lson);
cout << p->data << " ";
inorder(p->Rson);
}
int main() {
int n, m, w[5];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> w[i];
}
Hfptr p1 = initiation(w, n);
Hfptr p2 = creatHftree(p1, n);
inorder(p2);
return 0;
}
注意:代码使用语言为C++!