Description: [Problem Description] known input string of positive integers, positive integers separated by a space key, create a Huffman tree to enter the number of leaf nodes, find the right tree Huffman tree with path length . [Form] enter the number of first enter a positive integer, then the next for the next positive integer, the number of positive integers up to 10 outputs in the form [] output corresponding weight
To Search:
File list (Check if you may need any files):
1\4-1.c
.\4-1.dsp
.\4-1.dsw
.\4-1.ncb
.\4-1.opt
.\4-1.plg
.\Debug\4-1.exe
.\.....\4-1.ilk
.\.....\4-1.obj
.\.....\4-1.pch
.\.....\4-1.pdb
.\.....\try.pch
.\.....\vc60.idb
.\.....\vc60.pdb
.\try.c
.\try.dsp
.\try.dsw
.\try.ncb
.\try.opt
.\try.plg
.\Debug
1
Download