使用C++实现 哈夫曼树(创建和打印)

使用C++实现 哈夫曼树(创建和打印)

#include <iostream>
#include <map>
using namespace std;

//哈夫曼数结点类型定义
typedef struct
{
    int weight;
    int parent, lchild, rchild;
} HTNode, *HuffmanTree;

//从HT[1]~HT[n]中选取parent为0的，对weight进行排序，并找出最小的两个weight的下标存进s1和s2
void Select(HuffmanTree &HT, int n, int &s1, int &s2)
{
    map<int, int> m;
    for (int i = 1; i <= n; i++)
    {
        if (HT[i].parent == 0)
        {
            m.insert(make_pair(HT[i].weight, i));
        }
    }
    map<int, int>::iterator it = m.begin();
    s1 = (*it).second;
    it++;
    s2 = (*it).second;
}

//创建哈夫曼树，叶子结点数为n
void CreateHuffmanTree(HuffmanTree &HT, int n)
{
    if (n <= 1)
        return;
    int m = 2 * n - 1;      //总结点数
    HT = new HTNode[m + 1]; //哈夫曼结点顺序表(0不用，可索引1~m)
    //结点初始化，将所有结点的双亲和孩子信息置为0
    for (int i = 1; i <= m; i++)
    {
        HT[i].parent = 0;
        HT[i].lchild = 0;
        HT[i].rchild = 0;
    }
    for (int i = 1; i <= n; i++)
    {
        cin >> HT[i].weight;
    }
    //开始创建哈夫曼树
    for (int i = n + 1; i <= m; i++)
    {
        int s1, s2;
        Select(HT, i - 1, s1, s2);
        //删除结点
        HT[s1].parent = i;
        HT[s2].parent = i;
        //合并结点
        HT[i].lchild = s1;
        HT[i].rchild = s2;
        HT[i].weight = HT[s1].weight + HT[s2].weight;
    }
}

//打印哈夫曼树
void PrintHuffmanTree(HuffmanTree &HT, int n)
{
    cout << "index" << '\t' << "weight" << '\t' << "parent" << '\t' << "lChild" << '\t' << "rChild" << endl;
    for (int i = 1; i <= 2 * n - 1; ++i)
    {
        cout << i << "\t";
        cout << HT[i].weight << '\t';
        cout << HT[i].parent << "\t";
        cout << HT[i].lchild << "\t";
        cout << HT[i].rchild << endl;
    }
}

int main()
{
    HuffmanTree hf;
    CreateHuffmanTree(hf, 5);
    PrintHuffmanTree(hf, 5);
}