http://ickivrg5jucpkdfw5d6qeja6srtpox7yofkyygc44gnwbpj2tf2mekqd.onion
For example, a leaf node which contains the character 'a' is serialised as a . The serialisation of a tree that contains two smaller subtrees is ( \(A\) , \(B\) ) , where \(A\) is the serialisation of the left subtree, and \(B\) is the serialisation of the right subtree.