Printable View
How to implement Huffman's algorithm using sequential representation of binary tree?
Just put the 1 next to the 2 and hit the 'Easy' button.
