# On the Number of 2-Protected Nodes in Tries and Suffix Trees

Abstract : We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases. For instance, in a uniform trie with $n$ leaves, the number of 2-protected nodes is approximately 0.803$n$, plus small first-order fluctuations. The 2-protected nodes are an emerging way to distinguish the interior of a tree from the fringe.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [15 references]

https://hal.inria.fr/hal-01197232
Contributor : Coordination Episciences Iam <>
Submitted on : Friday, September 11, 2015 - 12:54:53 PM
Last modification on : Tuesday, March 7, 2017 - 3:18:52 PM
Long-term archiving on: : Tuesday, December 29, 2015 - 12:34:07 AM

### File

dmAQ0130.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01197232, version 1

### Citation

Jeffrey Gaither, Yushi Homma, Mark Sellke, Mark Daniel Ward. On the Number of 2-Protected Nodes in Tries and Suffix Trees. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.381-398. ⟨hal-01197232⟩

Record views