Average depth in a binary search tree with repeated keys

@inproceedings{Archibald2006AverageDI,
  title={Average depth in a binary search tree with repeated keys},
  author={Margaret Archibald and Julien Cl{\'e}ment},
  year={2006}
}
Random sequences from alphabet {1, . . . , 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. 

From This Paper

Figures, tables, and topics from this paper.
6 Citations
6 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Combinatorial Problems Related to Sequences with Repeated Entries

  • M. Archibald
  • PhD thesis, School of Mathematics, University of…
  • 2005
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…