The Height of List-tries and TST

N. Broutin (1) , L. Devroye (1)

1 School of Computer Science [Montréal]

We characterize the asymptotics of heights of the trees of de la Briandais and the ternary search trees (TST) of Bentley and Sedgewick. Our proof is based on a new analysis of the structure of tries that distinguishes the bulk of the tree, called the $\textit{core}$, and the long trees hanging down the core, called the $\textit{spaghettis}$.

Mots clés: Tries; branching process; height; de la Briandais; TST

Domaines: Algorithme et structure de données [cs.DS]; Mathématique discrète [cs.DM]; Combinatoire [math.CO]; Géométrie algorithmique [cs.CG]

N. Broutin, L. Devroye. The Height of List-tries and TST. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.271-282, ⟨10.46298/dmtcs.3536⟩. ⟨hal-01184784⟩