3. Consider the alphabet: A = {A, B, C, D}, with the following
probabilities of occurrences

Symbol	Probability
  A	   0.7
  B	   0.10
  C	   0.05
  D	   0.15

Find the Huffman tree, and give the average code length of the
corresponding code.

---

Request for Question Clarification by rbnn-ga on 17 Nov 2002 10:13 PST

Hi wjs-ga, 
 
I am interested in answering your question, but I believe that, to
answer
it well, your question will require more time and effort than the
average
amount of time and effort associated with $2.00. Here is a link to  
guidelines about pricing your question,  
 
https://answers.google.com/answers/pricing.html  
 
If you both significantly raise your price and also post a
clarification here, the
system will notify me and I will take another look at your question.

---

Request for Question Clarification by rbnn-ga on 17 Nov 2002 11:09 PST

I meant "Hi math01-ga" there. Sorry for any confusion.

Hello Math01,

There is a good example for almost the exact same problem at
  http://www.geocities.com/hmaxf_urlcr/huffman.htm

Using the following code...
 A = 0
 D = 10
 B = 110
 C = 111
and the probabilities you specified, the average bit size is 
 1 x 0.7 + 2 x .15 + 3 x .15 = 1.45

Good search phrases include:
  huffman compression code algorithm

  --Maniac