实现哈夫曼编码

#include<iostream>
#include<algorithm>
#include<set>
#include <queue>
#include<string>
using  namespace std;
typedef  struct  Node{
    string name;//字符
    int value;//加权值
    Node* left;
    Node* right;
};
vector<Node*> nodes;//表示结点的指针组
double char_number = 0;//每个字符平均花费的编码长度
const int char_num = 6;
int Data[char_num] = {45, 13, 12, 16, 9, 5};
string str[char_num] = {"a", "b", "c", "d", "e", "f"};
bool cmp(Node* v1, Node* v2)//重定义比较参数
{
    return v1->value < v2->value;
}
void Init_Vector(int n);//初始化含有指针是数组
Node* Creat_Tree(int n);//创建哈夫曼树
void Print(Node* tree, string name);//输出编码
int main()//主函数
{
    int n;
    Node* node;
    Init_Vector(char_num);
    node = Creat_Tree(char_num);
    Print(node, "");
    cout << "的那个字符所需要的编码长度: " << char_number;
}
void Init_Vector(int n)
{
    for(int i = 0; i < n; i++)
    {
        Node *node;
        node = new Node;
        node->name = str[i];
        node->value = Data[i];
        node->left = NULL;
        node->right = NULL;
        nodes.push_back(node);
    }
    sort(nodes.begin(), nodes.end(), cmp);
}
Node* Creat_Tree(int n)
{
    for(int i = 0; i < n -1; i++)
    {
        Node* node;
        node = new Node;//动态分配父节点
        node->value = nodes[0]->value + nodes[1]->value;//父节点的加权路径
        node->left = nodes[0];
        node->right = nodes[1];
        nodes.erase(nodes.begin());//
        nodes.erase(nodes.begin());//在vector中去除两个子树的指针
        nodes.push_back(node);//把父节点的指针放入vector中
        sort(nodes.begin(), nodes.end(), cmp);//按加权值排序
    }
    return nodes[0];
}
void Print(Node* tree, string name)
{
    if(tree == NULL)
        return;
    if(tree ->right == NULL && tree->left == NULL)
    {
        cout << name <<" " << tree->name << endl;
        char_number += double(name.size() * tree->value) / 100;//统计平均字符所用的编码长度
    }
    Print(tree->left, name + "0");
    Print(tree->right, name + "1");
}