哈夫曼树+哈夫曼编码

// HuffmanTree.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include<iostream>
#include<string>
using namespace std;

struct element
{
    int weight;
    char f;
    int lchild, rchild, parent;
};
void Select(element huffTree[], int *a, int *b, int n);
void HuffmanTree(element huffTree[], int w[], char ch[], int n)
{
    for (int i = 0; i < 2 * n - 1; i++)
    {
        huffTree[i].parent = -1;
        huffTree[i].lchild = -1;
        huffTree[i].rchild = -1;
    }
    for (int i = 0; i < n; i++)
    {
        huffTree[i].weight = w[i];
        huffTree[i].f = ch[i];
    }
    int i1, i2;
    for (int k = n; k < 2 * n - 1; k++)
    {
        i1 = 0; i2 = 0;
        Select(huffTree, &i1, &i2,k);
        huffTree[i1].parent = k;    //将 i1 和 i2 合并，则 i1 和 i2 的双亲是 k 
        huffTree[i2].parent = k;
        huffTree[k].weight = huffTree[i1].weight + huffTree[i2].weight;
        huffTree[k].lchild = i1;
        huffTree[k].rchild = i2;
    }
}
void Select(element huffTree[], int *a,int *b, int n)
{
    int i;
    int weight = 0;
    for (int i = 0; i < n; i++)
    {
        if (huffTree[i].parent != -1)
            continue;
        else
        {
            if (weight == 0)
            {
                weight = huffTree[i].weight;
                *a = i;
            }
            else
            {
                if (huffTree[i].weight < weight)
                {
                    weight = huffTree[i].weight;
                    *a = i;
                }

            }
        }
    }
    weight = 0;
    for (int i = 0; i < n; i++)
    {
        if (huffTree[i].parent != -1 || (i == *a))
            continue;
        else
        {
            if (weight == 0)
            {
                weight = huffTree[i].weight;
                *b = i;
            }
            else
            {
                if (huffTree[i].weight < weight)
                {
                    weight = huffTree[i].weight;
                    *b = i;
                }
            }
        }
    }
    int temp;
    if (huffTree[*a].lchild < huffTree[*b].lchild)
    {
        temp = *a;
        *a = *b;
        *b = temp;
    }

}
void Huffmancode(element huffTree[], int n)
{
    int j,k;
    string s = "";
    for (int i = 0; i < n; i++)
    {
        s = "";
        j = i;
        while (huffTree[j].parent != -1)
        {
            k = huffTree[j].parent;
            if (j == huffTree[k].lchild)
                s = s + "0";
            else
                s = s + "1";
            j = huffTree[j].parent;
        }
        cout << "字符" << huffTree[i].f << "的编码：" << endl;
        cout << s;
        cout << endl;
    }
}
int main()
{
    int n = 6;
    element huffTree[12];
    char ch[] = { 'a','b','c','d','e','f' };
    int w[] = { 1,2,3,4,5,6};
    HuffmanTree(huffTree, w, ch, n);
    Huffmancode(huffTree, n);
    system("pause");
    return 0;
}