<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[kuake56的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/kuake56</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; kuake56]]></copyright><item><title><![CDATA[构建遍历哈夫曼树并计算哈夫曼编码]]></title><link>https://blog.youkuaiyun.com/kuake56/article/details/81534528</link><guid>https://blog.youkuaiyun.com/kuake56/article/details/81534528</guid><author>kuake56</author><pubDate>Thu, 09 Aug 2018 12:32:56 +0800</pubDate><description><![CDATA[构建哈夫曼树并计算叶子结点的哈夫曼编码，利用结构体指针数组构建。

 


#include&amp;lt;iostream&amp;gt;
#define length 6
using namespace std;
struct Tree{
	int data;
	Tree *left;
	Tree *right;
};

//构造哈夫曼树
Tree *creatHT(int *arr){

	Tree *pA...]]></description><category></category></item></channel></rss>