Description: Construct a binary tree, if the weighted path length to a minimum, so called binary tree is optimal binary tree, also known as Huffman
To Search:
File list (Check if you may need any files):
Huffman
.......\.vs
.......\...\Huffman
.......\...\.......\v14
.......\...\.......\...\.suo
.......\Debug
.......\.....\Huffman.exe
.......\.....\Huffman.ilk
.......\.....\Huffman.pdb
.......\Huffman
.......\Huffman.sdf
.......\Huffman.sln
.......\.......\Debug
.......\.......\.....\Huffman.log
.......\.......\.....\Huffman.obj
.......\.......\.....\Huffman.tlog
.......\.......\.....\............\CL.read.1.tlog
.......\.......\.....\............\CL.write.1.tlog
.......\.......\.....\............\Huffman.lastbuildstate
.......\.......\.....\............\link.read.1.tlog
.......\.......\.....\............\link.write.1.tlog
.......\.......\.....\HuffmanCoding.obj
.......\.......\.....\vc140.idb
.......\.......\.....\vc140.pdb
.......\.......\Huffman.c
.......\.......\Huffman.h
.......\.......\Huffman.vcxproj
.......\.......\Huffman.vcxproj.filters
.......\.......\Huffman.vcxproj.user
.......\.......\HuffmanCoding.c
Download