#ifndef _HUFFMAN_B_HEADER_001_#define _HUFFMAN_B_HEADER_001_#include "huffman_base.h"// 使用《數(shù)據(jù)結(jié)構(gòu)》（嚴(yán)蔚敏，吳偉民，1997，C語(yǔ)言版）// 中給出的算法，將二叉樹存放在連續(xù)空間里（靜態(tài)鏈表），// 空間的每個(gè)結(jié)點(diǎn)內(nèi)仍有左子樹、右子樹、雙親等指針class huffman_b :	public huffman_base{public:	huffman_b() {}		virtual ~huffman_b(void) {}public:	typedef struct 	{		unsigned long weight;		int parent, lchild, rchild;	}HTNode, *HuffmanTree;public:	void generate_codes(int num, const unsigned long* weights);protected:	// 在HT[1..n]中選擇parent為0且weight最小的兩個(gè)結(jié)點(diǎn)，返回其序號(hào)s1和s2	void select(HuffmanTree tree, int n, int& s1, int& s2);};#endif