HuffmanAlgorithm.HuffmanTree overview
Public Instance Fields
 FT | The frequency table to build the Huffman tree with. |
| Leafs | This array hold the value of a byte and it is as long as a frequency table. |
| RootNode | The root node in the tree to be build; |
Public Instance Methods
 Equals (inherited from Object) | Determines whether the specified Object is equal to the current Object. |
| GetHashCode (inherited from Object) | Serves as a hash function for a particular type, suitable for use in hashing algorithms and data structures like a hash table. |
| GetType (inherited from Object) | Gets the Type of the current instance. |
| ToString (inherited from Object) | Returns a String that represents the current Object. |
Protected Instance Methods
 Finalize (inherited from Object) | Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection. |
| MemberwiseClone (inherited from Object) | Creates a shallow copy of the current Object. |
Internal Instance Constructors
HuffmanAlgorithm.HuffmanTree Constructor
|
Build a Huffman tree out of a frequency table. |
Private Instance Fields
 OrphanNodes | This holds nodes without parents; |
Private Instance Methods
 BuildTree | This function build a tree from the frequency table |
| FindSmallestOrphanNodes | Finds the smallest and the 2nd smallest value orphan nodes and removes them them from the arraylist. |
See Also
HuffmanAlgorithm.HuffmanTree Class | JadBenAutho.Tools Namespace