Indexed metadata
On the Number of 2-Protected Nodes in Tries and Suffix Trees
Jeffrey Gaither, Yushi Homma, Mark Sellke, Mark Daniel Ward
Source 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 leaves, the number of 2-protected nodes is approximately 0.803, plus small first-order fluctuations. The 2-protected nodes are an emerging way to distinguish the interior of a tree from the fringe.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.