ABSTRACT

Strengths: The compressed trie makes further reductions (from those of the compact trie) in both the expected number of trie nodes and also in the expected height of the trie. These savings are obtained by performing compression to remove any internal nodes with only a single child. In most cases, this compression reduces the overall space complexity of the data structure.