C++实现哈夫曼树编码解码

代码：

#pragma once
#include<iostream>
#include<stack>
using  namespace std;
#define m 20
stack<int> s;
/*哈夫曼树结点类HuffmanNode声明*/
template<class T>
class HuffmanNode {
private:
	HuffmanNode<T> * left;
	HuffmanNode<T> * right;
	T data;
	int weight;
public:
	HuffmanNode(){}
	HuffmanNode(const T& item, HuffmanNode<T> * l, HuffmanNode<T> * r):data(item),left(l),right(r){}
	HuffmanNode<T> * getLeft() { return left; }
	void setLeft(HuffmanNode<T> * left) { this->left = left; }
	HuffmanNode<T> * getRight() { return right; }
	void setRight(HuffmanNode<T> * right) { this->right=right; }
	T& getData() { return data; }
	void setData(const T& item) { data = item; }
	int getWeight() { return weight; }
	void setWeight(int weight) { this->weight = weight; }
};

/*哈夫曼树类HuffmanTree声明*/
template<class T>
class HuffmanTree {
private:
	HuffmanNode<T> * root;
	T dat