Randomized Ternary Search Tries
Data Structures and Algorithms
2017-01-10 v9
Abstract
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.
Cite
@article{arxiv.1606.04042,
title = {Randomized Ternary Search Tries},
author = {Nicolai Diethelm},
journal= {arXiv preprint arXiv:1606.04042},
year = {2017}
}
Comments
6 pages; v20: minor clarification in the "Analysis" section