The Height of List-tries and TST - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2007

The Height of List-tries and TST

Abstract

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}$.
Fichier principal
Vignette du fichier
dmAH0118.pdf (353.26 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184784 , version 1 (17-08-2015)

Identifiers

Cite

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⟩

Collections

INSMI TDS-MACS
37 View
634 Download

Altmetric

Share

Gmail Facebook X LinkedIn More