文件名称:hftree
介绍说明－－下载内容均来自于网络，请自行研究使用
哈夫曼树 c++实现 哈夫曼树(Huffman Tree) 假设有n个权值{ W1，W2，…，W n }，试构造有n个叶子结点的二叉树，每个叶子结点拥有一个权值W ，则其中带权路径长度WPL 最小的二叉树，称为最优二叉树或哈夫曼树。-C++ Huffman tree Huffman tree (Huffman Tree) Suppose there are n weights {W1, W2, ..., W n}, the test structure has n leaf nodes of the binary tree, each leaf node has a right value W, which is the minimum weighted path length WPL binary tree, called optimal binary tree Huffman tree.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
hftree
......\Debug
......\.....\hftree.bsc
......\.....\hftree.exe
......\.....\hftree.ilk
......\.....\hftree.obj
......\.....\hftree.pch
......\.....\hftree.pdb
......\.....\hftree.sbr
......\.....\StdAfx.obj
......\.....\StdAfx.sbr
......\.....\vc60.idb
......\.....\vc60.pdb
......\hftree.cpp
......\hftree.dsp
......\hftree.dsw
......\hftree.ncb
......\hftree.opt
......\hftree.plg
......\ReadMe.txt
......\StdAfx.cpp
......\StdAfx.h