Beginning Java Data Structures and Algorithms

Developing an Algorithm to Generate Code Words Using Huffman Coding

To implement an algorithm capable of building the tree that generates the binary code words for the character in a data file using Java:

1. Use a priority queue to store nodes with the character frequency.
2. Repeatedly join the two nodes with the least frequencies until you are left with a single node. The source code for this algorithm is as follows:

for (int i = 0; i < N - 1; i++) {  Node n = new Node();  n.left = pq.remove();  n.right = pq.remove();  n.frequency = n.left.frequency + n.right.frequency;  pq.add(n);}

Snippet 4.2: Huffman code. Source class name: Huffman

Go to https://goo.gl/indhgT to access the full code.

We make use of a priority queue to store our nodes, making ...