Adaptive Huffman Coding Tree Example

The Huffman Coding algorithm requires the knowledge of the input data in advance to find out the frequency of occurrence of each symbol.

For live videos, audios – this data is not available. Adaptive Huffman Coding is useful in such cases which builds and updates the binary tree dynamically.

The binary Huffman tree should satisfy the Sibling Property.

Sibling property states that “each node (except the root) has a sibling and the nodes can be listed in order of non-increasing weight with each node adjacent to its siblings.”





Do NOT follow this link or you will be banned from the site!