Question: why huffman coding is lossless compression?
Answer: Also known as Huffman encoding, an algorithm for the lossless compression of files based on the frequency of occurrence of a symbol in the file that is being compressed. ... The more probable the occurrence of a symbol is, the shorter will be its bit-size representation.