随机三元搜索尝试
Randomized Ternary Search Tries
摘要：
本文提出了一种新的自平衡三元搜索trie树，它采用了一种随机平衡策略，适应于Aragon和Seidel的随机二叉搜索树（“treaps”）。在对字符串进行任何序列的插入和删除之后，树看起来像是通过以随机顺序插入字符串而构建的三元搜索trie。因此，在一个有n个字符串的树中搜索、插入或删除长度为k的字符串的时间开销最多为O（k + log n），且概率很高。
英文摘要：
This paper presents a new kind of self-balancing ternary search trie that uses a randomized balancing strategy adapted from Aragon and Seidel's randomized binary search trees ("treaps"). After any sequence of insertions and deletions of strings, the tree looks like a ternary search trie built by inserting strings in random order. As a result, the time cost of searching, inserting, or deleting a string of length k in a tree with n strings is at most O(k + log n) with high probability.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
