Skip to Main Content
Data Structures Using C, 2nd Edition by Pearson
book

Data Structures Using C, 2nd Edition by Pearson

by A. K. Sharma
May 2024
Intermediate to advanced content levelIntermediate to advanced
521 pages
14h 12m
English
Pearson India
Content preview from Data Structures Using C, 2nd Edition by Pearson
356 Data Structures Using C
in the list, we may have many
different Huffman trees. For
instance, in the example given
above in second step if we swap
the values of 3* and 3 and in
third step, swap the values of
6* and 6, we would get a differ-
ent Huffman tree as compared
to the Huffman tree obtained
above (see Figure 7.53). How-
ever, both the Huffman trees
will have the same weighted
path lengths, i.e. 74.
Thus, construction of Huff-
man tree by the Huffman algo-
rithm may not always result in a
unique tree.
As discussed above, the Huffman tree can be usefully applied to data compression techniques for
storing files ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Structures Using C

Data Structures Using C

Samir Kumar Bandyopadhyay, Kashi Nath Dey
Intermediate C Programming, 2nd Edition

Intermediate C Programming, 2nd Edition

Yung-Hsiang Lu, George K. Thiruvathukal

Publisher Resources

ISBN: 9781299831582