public class Huffman $*$ Inner class Huffman Node to Store a node of Huffman Tree$**/$private class HuffmanTreeNode private int character;$//$ character being represented by this node $($applicable to leaves$)$private int count;$//$ frequency for the subtree rooted at nodeprivate HuffmanTreeNode left; $//$ left$/0$ subtree $($NULL if empty$)$ private HuffmanTreeNode right; $//$ right$/1$ subtree subtree $($NULL if empty$)$public HuffmanTreeNode $($int c$,$ int ct$,$ HuffmanTreeNode leftNode, HuffmanTreeNode rightNode$)\{$character $=$ c;count $=$ ct;left $=$ leftNode;right $=$ rightNode;public int getChar$()\{$ return character;$)$ public Integer getCount$)\{$ return count; $\}$ public HuffmanTreeNode getLeft$()($ return left;$\}$ public HuffmanTreeNode getRight$()($ return right;$)$public boolean isLeaf$()\{$ return left$==$null ;) $//$ since huffman tree is full; if leaf$=$null so mus