# Renewal theory in analysis of tries and strings

## TL;DR

This paper surveys how renewal theory can be applied to analyze various properties of random strings and trie data structures, including depth, size, and coding schemes.

## Contribution

It provides a comprehensive overview of renewal theory applications to different trie variants and string coding problems, highlighting their analytical benefits.

## Key findings

- Renewal theory effectively analyzes trie properties.
- Applications extend to coding schemes like Khodak and Tunstall.
- Insights into trie imbalance and insertion depth variations.

## Abstract

We give a survey of a number of simple applications of renewal theory to problems on random strings and tries: insertion depth, size, insertion mode and imbalance of tries; variations for b-tries and Patricia tries; Khodak and Tunstall codes.