preview

Microsoft Class Tree Implements Comparable ( HTML )

Decent Essays
Open Document

import java.io.*; import java.util.*;

class tableNode
{
public final char value; public final String prefix; public final int frequency; public tableNode(char c, String pfx, int freq) { value = c; prefix = pfx; frequency = freq; }
}

abstract class tree implements Comparable (-- removed HTML --)
{
public final int frequency; public tree(int freq) { frequency = freq; } public int compareTo(tree tree) { return (frequency - tree.frequency); }
}

class HuffmanLeafNode extends tree
{
public final char value; // the character this leaf represents public HuffmanLeafNode(int freaky, char symbol) { //shes a super freak, …show more content…

poll(); } public static void printFreqTable(tree tree, PrintWriter printWriter) { assert tree != null; if (tree instanceof HuffmanLeafNode) { //HuffmanLeafNode leafNode = tree.HuffmanLeafNode; HuffmanLeafNode leafNode = (HuffmanLeafNode)tree; printWriter.println(leafNode.value + "\t\t" + leafNode.frequency); //System.out.println("Wrote a leaf in"); } else if (tree instanceof HuffmanNode) { HuffmanNode node = (HuffmanNode)tree; //left printFreqTable(node.leftSub, printWriter); //right printFreqTable(node.rightSub, printWriter); } } public static void printHuffmanTable(tree tree, StringBuffer pfx, PrintWriter printWriter) { assert tree != null; if (tree instanceof HuffmanLeafNode) { HuffmanLeafNode leafNode = (HuffmanLeafNode)tree; // print out character, frequency, and code for this leaf (which is just the prefix) printWriter.println(leafNode.value + "=" + pfx); } else if (tree instanceof HuffmanNode) { HuffmanNode node = (HuffmanNode)tree;

//prefix code builders //left pfx.append('0'); printHuffmanTable(node.leftSub, pfx, printWriter); pfx.deleteCharAt(pfx.length()-1); //right pfx.append('1');

Get Access
Related
Get Access