huffman - number of times input character was used...

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

View Full Document Right Arrow Icon
// ------------------------------ Huffman tree class (huffman.h) --------- class node { // both a linked list and a binary tree public: // this structure starts out as a linked list // then transforms into a binary huffman tree // ----- linked list ------------------- char inchar; // input character int frequency;
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: // number of times input character was used node *next; // next node in the linked list // ----- binary tree -------------------node *nleft; // left node in the binary tree node *nright; // right node in the binary tree char huffcode[MAXHUFF]; // huffman code for this node };...
View Full Document

This note was uploaded on 01/19/2010 for the course CSC 375 taught by Professor Turner during the Spring '09 term at University of Michigan-Dearborn.

Ask a homework question - tutors are online