Data structure  What is the Huffman algorithm?
What is the Huffman algorithm? In Huffman Algorithm, a set of nodes assigned with values is fed to the algorithm.
 Initially 2 nodes are considered and their sum forms their parent node.
 When a new element is considered, it can be added to the tree.
 Its value and the previously calculated sum of the tree are used to form the new node which in turn becomes their parent.
 This algorithm is based on the frequency of occurrence of a data item.
 It uses a specific method for choosing the representation for each symbol.
