#ifndef _HUFFMAN_B_HEADER_001_#define _HUFFMAN_B_HEADER_001_#include "huffman_base.h"// 使用《數據結構》（嚴蔚敏，吳偉民，1997，C語言版）// 中給出的算法，將二叉樹存放在連續空間里（靜態鏈表），// 空間的每個結點內仍有左子樹、右子樹、雙親等指針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最小的兩個結點，返回其序號s1和s2	void select(HuffmanTree tree, int n, int& s1, int& s2);};#endif