We characterize the asymptotics of heights of the trees of de la Briandais and the ternary search trees (TST) of Bentley and Sedgewick. Our proof is based on a new analysis of the structure of tries that distinguishes the bulk of the tree, called the $\textit{core}$, and the long trees hanging down the core, called the $\textit{spaghettis}$
AbstractVarious topological indices have been put forward in different studies, from biochemistry to...
AbstractWe consider random tries and random PATRICIA trees constructed from n independent strings of...
Abstract. It is shown that all centralized absolute moments E|Hn − EHn | α (α ≥ 0) of the height Hn ...
We introduce a weighted model of random trees and analyze the asymptotic properties of their heights...
. The number of descendants of a node in a binary search tree (BST) is the size of the subtree havin...
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
AbstractWe study the height of the binary search tree—the most fundamental data structure used for s...
We study numerically a non-linear integral equation that arises in the study of binary search trees....
In the present paper we consider a generalized class of extended binary trees in which leaves are ...
In the present paper we consider a generalized class of extended binary trees in which leaves are di...
AbstractThe average height of a binary tree with n internal nodes is shown to be asymptotic to 2√πn....
We consider here the probabilistic analysis of the number of descendants and the number of ascendant...
AbstractWe show that binary search trees of a given size tend to have smaller height when the root d...
We consider random tries and random patricia trees constructed from n independent strings of symbols...
Binary search trees are one of the most fundamental data structures. While the height of such a tree...
AbstractVarious topological indices have been put forward in different studies, from biochemistry to...
AbstractWe consider random tries and random PATRICIA trees constructed from n independent strings of...
Abstract. It is shown that all centralized absolute moments E|Hn − EHn | α (α ≥ 0) of the height Hn ...
We introduce a weighted model of random trees and analyze the asymptotic properties of their heights...
. The number of descendants of a node in a binary search tree (BST) is the size of the subtree havin...
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
AbstractWe study the height of the binary search tree—the most fundamental data structure used for s...
We study numerically a non-linear integral equation that arises in the study of binary search trees....
In the present paper we consider a generalized class of extended binary trees in which leaves are ...
In the present paper we consider a generalized class of extended binary trees in which leaves are di...
AbstractThe average height of a binary tree with n internal nodes is shown to be asymptotic to 2√πn....
We consider here the probabilistic analysis of the number of descendants and the number of ascendant...
AbstractWe show that binary search trees of a given size tend to have smaller height when the root d...
We consider random tries and random patricia trees constructed from n independent strings of symbols...
Binary search trees are one of the most fundamental data structures. While the height of such a tree...
AbstractVarious topological indices have been put forward in different studies, from biochemistry to...
AbstractWe consider random tries and random PATRICIA trees constructed from n independent strings of...
Abstract. It is shown that all centralized absolute moments E|Hn − EHn | α (α ≥ 0) of the height Hn ...
DOI
Add to ORKG