Example of Huffman Tree Algorithm (1)

• P(a) =.4, P(b)=.1, P(c)=.3, P(d)=.1, P(e)=.1

a

b

c

d

e

.4

.1

.3

.1

.1

a

b

c

d

e

.4

.3

.1

.2

Previous slide

Next slide

Back to first slide

View graphic version