On protected nodes in Digital Search Trees
Combinatorics
2011-11-08 v1 Probability
Abstract
Recently, 2-protected nodes were studied in the context of ordered trees and -trees. These nodes have a distance of at least 2 to each leaf. Here, we study digital search trees, which are binary trees, but with a different probability distribution underlying. Our result says, that \emph{grosso modo} some 31% of the nodes are 2-protected. Methods include exponential generating functions, contour integration, and some elements from -analysis.
Keywords
Cite
@article{arxiv.1111.1471,
title = {On protected nodes in Digital Search Trees},
author = {Rosena R. X. Du and Helmut Prodinger},
journal= {arXiv preprint arXiv:1111.1471},
year = {2011}
}
Comments
6 pages, 1 figure