In binary Huffman code, the code for each symbol will be a combination of ones and zeros. The Huffman code can be represented as a binary tree in which the leaves corresponds to the symbols. The Huffman code for any symbol can be obtained by transversing the tree from root node to the leaf corresponding to the symbol by assigning a 0 to the code word every time the transversal takes us over upper branch and assigning a 1 every time the transverse takes us over a lower branch. In other words, characters or symbols with higher probability of occurrence get shorter codes. Coding a stream of data using Huffman encoding is done by forming a Huffman tree. The procedure for building this tree is simple