hfm_tree.h

来自「HuffmanTree_code 哈夫曼树的定义及存储；哈夫曼树的构造；哈夫曼」· C头文件 代码 · 共 33 行

//Hfm_Tree.h
//uuhorse
//2008.05.20

#ifndef _MG_HUFFMANTREE_HFM_TREE_H
#define _MG_HUFFMANTREE_HFM_TREE_H


#include <stdio.h>
#include <malloc.h>
#include <string.h>


typedef struct
{
	unsigned int weight;
	unsigned int parent,lchild,rchild;

}HTNode, *HuffmanTree;

typedef char ** HuffmanCode;


void HuffmanCoding (HuffmanTree &HT, HuffmanCode &HC, int *w, int n);
//w存在n个字符的权值(均>0),构造哈夫曼树HT,并求出n个字符的哈夫曼编码HC

void Select( HuffmanTree HT, int hi, int &s1, int &s2);
//在HT[1...i-1]中选择parent为0且权值weight最小的两个节点，其序号分别为s1和s2;




#endif