This webapp generates Huffman Trees out of short snippets of text. The process of building Huffman trees is called Huffman Coding. It is a lossless data compression algorithm. The technique consists in building a weight-ordered binary tree of characters so that each character correspons to a binary values. The higher the frequency of the character in the text, the shorter its encoded representation should be in order to optimize savings.
No copyright is claimed on the images generated by this webapp. You can freely use them in your assignments, blog posts or articles without a charge or need to ask for permission. Please try to include the attribution to the URL, but it's okay if you don't.