Data compression

EasyMedium
1234567891011121314151617181920212223242526272829303132333435363738394041
Question 9
Easy

A Huffman tree has been created for the phrase 'TEA TIME'.

Huffman tree diagram for the string TEA TIME. The root node is 8. The left branch is labeled 0 leading to internal node 4, and the right branch is labeled 1 leading to internal node 4. The left node 4 has a left branch 0 to leaf T(2) and a right branch 1 to leaf E(2). The right node 4 has a left branch 0 to internal node 2, and a right branch 1 to internal node 2. The left internal node 2 has a left branch 0 to leaf A(1) and a right branch 1 to leaf SPACE(1). The right internal node 2 has a left branch 0 to leaf I(1) and a right branch 1 to leaf M(1).

What is the correct binary encoding for the substring MATE?

LetterBinary Encoding
M
A
T
E

Write your final full sequence below your table.

[2]

Data compression Questions

  1. GCSE
  2. /Computer Science
  3. /Data compression