The suffix tree is a very important data structure, which finds a wide variety of applications in many areas related to string processing.
后缀树是一种非常重要的数据结构，它在与字符串处理相关的各种领域里有着非常广泛的应用。
You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.
你只需要能够确保二叉树可以序列化成一个字符串，并且可以反序列化成原始树结构即可。
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.
除此之外，算法对频繁模式树中每个节点增加一个位串来存储该项目的前缀项目，以避免在模式扩展的时候频繁的遍历子树。
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.
除此之外，算法对频繁模式树中每个节点增加一个位串来存储该项目的前缀项目，以避免在模式扩展的时候频繁的遍历子树。
应用推荐