http://ickivrg5jucpkdfw5d6qeja6srtpox7yofkyygc44gnwbpj2tf2mekqd.onion
For example, consider the following Huffman tree: Given the above tree, the code of the character s is 00 , as the path from the root to the node containing s is "left, left". The code of the character t is 010 , the code of the character e is 011 , and so on.