哈夫曼树

最新推荐文章于 2025-01-02 21:11:47 发布

weixin_30566149

最新推荐文章于 2025-01-02 21:11:47 发布

阅读量60

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/NDKY9/p/7820075.html

本文介绍了一种使用C++实现哈夫曼树的方法。通过定义结构体和比较函数，实现了一个从输入权重到构建完整哈夫曼树的过程，并输出了树的节点信息。该实现利用了向量来存储节点，通过不断合并最小权重的两个节点来构建最终的哈夫曼树。

#include<vector>
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
 
struct HT
{
    int weight, parent, l, r, idx;
};
bool cmp(HT a, HT b)
{
    return a.weight < b.weight;
}
int main()
{
    int n;
    vector<HT>a, b;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        HT x;
        cin >> x.weight;
        x.idx = i;
        x.parent = -1;
        x.l = -1;
        x.r = -1;
        a.push_back(x);
        b.push_back(x);
    }
 
    while (a.size() != 1)
    {
        sort(a.begin(), a.end(), cmp);
        HT x;
        x.idx = b.size();
        x.weight = a[0].weight + a[1].weight;
        x.l = a[0].idx;
        x.r = a[1].idx;
        for (int i = 0; i < b.size(); i++)
        {
            if (b[i].idx == x.l || b[i].idx == x.r)
                b[i].parent = x.idx;
        }
        a.push_back(x);
        a.erase(a.begin());
        a.erase(a.begin());
        b.push_back(x);
    }
    b[b.size() - 1].parent = -1;
    for (int i = 0; i < b.size(); i++)
        printf("%d %d %d %d %d\n", b[i].idx, b[i].l, b[i].weight, b[i].r, b[i].parent);
    return 0;
}

转载于:https://www.cnblogs.com/NDKY9/p/7820075.html