A note on the probabilistic analysis of patricia trees

Authors:
Luc Devroye
Affiliations:
School of Computer Science, McGill University, 3840 University Street, Montreal, Canada H3A 2A7
Venue:
Random Structures & Algorithms
Year:
1992

Citing 0
Cited 2

On the average depth of asymmetric LC-tries

Information Processing Letters
Analysis of a class of tries with adaptive multi-digit branching

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider random PATRICIA trees constructed from n i.i.d. sequences of independent equiprobable bits. We study the height Hn (the maximal distance between the root and a leaf), and the minimal fill‐up level Fn (the minimum distance between the root and a leaf). We give probabilistic proofs of **image** and **image**. © 1992 Wiley Periodicals, Inc.