Implement the Huffman code in a relevant programming language to accept a given string of words as input. The code is expected to compute the sizes and frequencies of each non-repeated character in the given string and produce the complete Huffman tree with the edges labelled in binary and the nodes labelled with the correct character(s).

Produce as output, the compressed binary codes for the input string and compare with the binary codes of the original string.