 In standard Huffman coding this model takes the form of a tree of variable-length codes, with the most frequent symbols located at the top of the structure and being represented by the fewest bits.However, this code tree introduces two critical inefficiencies into an implementation of the coding scheme.Firstly, each node of the tree must store either references to its child nodes or the symbol that it represents.