The suffix tree is a very important data structure, which finds a wide variety of applications in many areas related to string processing.
后缀树是一种非常重要的数据结构，它在与字符串处理相关的各种领域里有着非常广泛的应用。
2
You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original treestructure.
你只需要能够确保二叉树可以序列化成一个字符串，并且可以反序列化成原始树结构即可。
3
In addition, we add a bit string to each node in the tree to store the prefix of the items. By using the structure we can avoid repeatedly traversing the sub-tree while expanding the patterns.