Average depth in a binary search tree with repeated keys - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2006

Average depth in a binary search tree with repeated keys

Abstract

Random sequences from alphabet $\{1, \ldots,r\}$ are examined where repeated letters are allowed. Binary search trees are formed from these, and the average left-going depth of the first $1$ is found. Next, the right-going depth of the first $r$ is examined, and finally a merge (or 'shuffle') operator is used to obtain the average depth of an arbitrary node, which can be expressed in terms of the left-going and right-going depths. The variance of each of these parameters is also found.
Fichier principal
Vignette du fichier
dmAG0122.pdf (288.02 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

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

Identifiers

Cite

Margaret Archibald, Julien Clément. Average depth in a binary search tree with repeated keys. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.309-320, ⟨10.46298/dmtcs.3496⟩. ⟨hal-01184700⟩
209 View
499 Download

Altmetric

Share

Gmail Facebook X LinkedIn More