哈夫曼树的构造，堆的基本使用，05-树9 Huffman Codes (30 分)

In 1953, David A. Huffman published his paper “A Method for the Construction of Minimum-Redundancy Codes”, and hence printed his name in the history of computer science. As a professor who gives the final exam problem on Huffman codes, I am encountering a big problem: the Huffman codes are NOT unique. For example, given a string “aaaxuaxz”, we can observe that the frequencies of the characters ‘a’, ‘x’, ‘u’ and ‘z’ are 4, 2, 1 and 1, respectively. We may either encode the symbols as {‘a’=0, ‘x’=10, ‘u’=110, ‘z’=111}, or in another way as {‘a’=1, ‘x’=01, ‘u’=001, ‘z’=000}, both compress the string into 14 bits. Another set of code can be given as {‘a’=0, ‘x’=11, ‘u’=100, ‘z’=101}, but {‘a’=0, ‘x’=01, ‘u’=011, ‘z’=001} is NOT correct since “aaaxuaxz” and “aazuaxax” can both be decoded from the code 00001011001001. The students are submitting all kinds of codes, and I need a computer program to help me determine which ones are correct and which ones are not.

Input Specification:
Each input file contains one test case. For each case, the first line gives an integer N (2≤N≤63), then followed by a line that contains all the N distinct characters and their frequencies in the following format:

c[1] f[1] c[2] f[2] … c[N] f[N]
where c[i] is a character chosen from {‘0’ - ‘9’, ‘a’ - ‘z’, ‘A’ - ‘Z’, ‘_’}, and f[i] is the frequency of c[i] and is an integer no more than 1000. The next line gives a positive integer M (≤1000), then followed by M student submissions. Each student submission consists of N lines, each in the format:

c[i] code[i]
where c[i] is the i-th character and code[i] is an non-empty string of no more than 63 '0’s and '1’s.

Output Specification:
For each test case, print in each line either “Yes” if the student’s submission is correct, or “No” if not.

Note: The optimal solution is not necessarily generated by Huffman algorithm. Any prefix code with code length being optimal is considered correct.

Sample Input:
7
A 1 B 1 C 1 D 3 E 3 F 6 G 6
4
A 00000
B 00001
C 0001
D 001
E 01
F 10
G 11
A 01010
B 01011
C 0100
D 011
E 10
F 11
G 00
A 000
B 001
C 010
D 011
E 100
F 101
G 110
A 00000
B 00001
C 0001
D 001
E 00
F 10
G 11
结尾无空行
Sample Output:
Yes
Yes
No
No
结尾无空行

这题主要考察了对哈夫曼树和堆的知识。
1.包括用堆构造哈夫曼树，堆的建立，插入与删除，其中堆的建立有两种方式，包括插入建立，也包括对已有的数据结构进行调整建立。
2.包括了哈夫曼树的建立，求哈夫曼树的权重，判断输入的二进制编码能否构成合理的哈夫曼树（这是一个难点）。
3.这里使用的是用堆的方式构造哈夫曼树。
4.也有其他方式构造哈夫曼树。如下代码。
代码量略微有点偏大。
1）首先，这里总结一下堆的使用，包括堆的建立，插入，散出以及堆的调整。
一.创建最小堆，以及最小堆的插入操作：

const int MaxSize = 1001;
const int MinData = -10001;
typedef int ElemType;
typedef struct HeapStruct
{
   
	int* elements;
	int size;
	int capacity;
}HeapStruct;
typedef struct HeapStruct* MinHeap;
//创建最小堆
MinHeap CreateHeap()
{
   
	MinHeap H = new HeapStruct;
	H->elements = new ElemType[MaxSize];//
	H->size = 0;
	H->capacity = MaxSize;
	H->elements[0] = MinData;
	return H;
}
//往最小堆中插入元素
void Insert(MinHeap& H, ElemType item)//主要这里面的引用
{
   
	int i;
	if (H->size >=H->capacity)
	{
   
		cout << "最小堆已满";
		return;
	}
	i = ++H->size;
	for (;H->elements[i / 2] > item;i /=2)
	{
   
		H->elements[i] = H->elements[i / 2];
	}
	H->elements[i] = item;
}

二.创建最大堆，以及最大堆的插入与删除操作。因为创建和插入与最小堆差不多，这里只写删除操作。

ElementType DeleteMax( MaxHeap H )
{
    /* 从最大堆H中取出键值为最大的元素，并删除一个结点 */
    int Parent, Child;
    ElementType MaxItem, X;

    if ( IsEmpty(H) ) {
   
        printf("最大堆已为空");
        return ERROR;
    }

    MaxItem = H->Data[1]; /* 取出根结点存放的最大值 */
    /* 用最大堆中最后一个元素从根结点开始向上过滤下层结点 */
    X = H->Data[H->Size--]; /* 注意当前堆的规模要减小 */
    for( Parent=1; Parent*2<=H->Size; Parent=Child ) {
   
        Child = Parent * 2;
        if( (Child!=H->Size) && (H->Data[Child]<H->Data[Child+1]) )
            Child++;  /* Child指向左右子结点的较大者 */
        if( X >= H->Data[Child] ) break; /* 找到了合适位置 */
        else