Please describe in brief.
Huffman’s algorithm in Data Structure ?
Ask by Anonymous User
Updated 07 Sep 2019
The Huffman’s algorithm is used for creating extended binary trees that have minimum weighted path lengths from the given weights. That makes use of a table that contains the frequency of occurrence for each data element.
The Huffman algorithm or Huffman coding is an entropy encoding algorithm.
This is used widely for data compression (like WinZip Compression-WinZip doesn’t use it but!)
The Huffman coding is used in JPEG compression.
The primary idea behind Huffman coding is to encode the most common characters using shorter strings of bits than those used for less common source characters.
That works by creating a binary tree stored in an array.
You also need to know the external path length (sum of all paths from the root to external node) and internal path length (sum of all paths from root to internal node).
Some important steps for the Huffman Algorithm