Assignment 1A Solution

The total number of leaves is so we have f 10 8 20v f

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview:  ¨£ C8U ¨ ¨ Define Let us construct a full binary tree of depth (i.e. leaves are at depth whereas root is at depth ) and let us mark left-ward edges with and right-ward edges with exactly as we did in the construction of Huffman code trees. Then, exactly as with Huffman codes, to each node (except the to root) corresponds a certain let us define to be the set of all leaves that are descendants of the node that code. For each corresponds to the code Then for the sets and must be disjoint. In the opposite case, would be a descendant a common leaf would be a descendant of both and and therefore one of of the other, contradicting the fact that is a prefix code. The total number of leaves is so we...
View Full Document

Ask a homework question - tutors are online