0

Write a filter that converts text from standard input to a representation of its Huffman tree on standard output.
you're free to consider newlines or not
output format is free, as long as it's some human-readable encoding of a tree. s-exps, ascii-art and .png, all good. RPN, .dot, I'll smile ...