Huffman Encoding / Trees

Soldato
Joined
27 Jun 2006
Posts
6,334
Hello folks, going over a few past papers for revision here and was just wondering if anyone would know the answer to this question:

2hdqn10.png


a) is easy enough to understand, you follow the paths using up the numbers in the bit pattern. But for the second one I just can't seem to begin piecing it together in my head.

I could create another tree with all those letters (a.w.o.d.c.u.t.e.r) in it but I assume they want the smallest string of numbers possible?

Appreciate any help. Thanks. :)
 
But they're only looking 'a woodcutter'. edit - Actually I'm not so sure now.

And surely this is networking? :p
 
Last edited:
Did the test today and despite my best efforts to revise it, this didn't come up!

I'd just like to thank everyone for their help and particularly matja for going to the effort of explaining all of that.
 
Back
Top Bottom