# Construct an Optimal Huffman Code and Tree

Not what you're looking for?

Suppose characters a, b, c, d, e, f, g, h, i, j, k have probabilities 0.01, 0.03, 0.03, 0.05, 0.05, 0.07, 0.09, 0.12, 0.13, 0.20, 0.22, respectively. Construct an optimal Huffman code and draw the Huffman tree.

Use the following rules:

a. Left: 0, right: 1

b. For identical probabilities, group them from the left to right.

What is the average code length?

##### Purchase this Solution

##### Solution Summary

Constructing an optimal Huffman code and tree is achieved.

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

##### Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

##### Javscript Basics

Quiz on basics of javascript programming language.

##### Basic Networking Questions

This quiz consists of some basic networking questions.

##### Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.