Huffman's Algorithm

Huffman's Algorithm:  Suppose w_{1 and w2 are two minimum weights among the n given weights w1, w2,..................,wn.Find a tree T ^{Prime which gives a solution for the n - 1 weights
      w1 + w2, w3, w4, ..........., wn
Then, in  the tree T Prime , replace the external node
w 1 + w2 by the subtree
The new 2-tree T Prime is desired solution}}

If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE