22.2.2. Building the Tree

Try these first

1. 1.

   What is Huffman coding used for?

   Hint

   Think about the purpose of reducing data size.

2. 2.

   Define what a 'node' is in the context of a tree.

   Hint

   Consider what makes up a structure in a tree.

3. 3.

   What does Huffman coding aim to achieve?

   • Data encryption
   • Data compression
   • Data encryption and compression

   Hint

   Remember, it's about reducing size.

4. 4.

   True or False: Huffman's algorithm guarantees an optimal solution.

   • True
   • False

   Hint

   Think about how the combinations are structured.

5. 5.

   Suppose you have the letters P, Q, R, S with frequencies 0.4, 0.15, 0.35, and 0.1. Construct the Huffman tree for these letters and determine the encoding for each letter.

   Hint

   Start merging the lowest frequencies first.

6. 6.

   Explain the steps you would take to implement the heap in the Huffman coding process and why each step is necessary for efficiency.

   Hint

   Think about how a heap organizes data for quick access and updates.