Publication date
January 2002
DOI Publisher
Elsevier Science B.V. ISSN
0304-3975Abstract
AbstractBy using analytic tools it is shown that the variance E(Hn−EHn)2 of the height Hn of binary search trees of size n is bounded
AbstractBy using analytic tools it is shown that the variance E(Hn−EHn)2 of the height Hn of binary search trees of size n is bounded
We study numerically a non-linear integral equation that arises in the study of binary search trees....
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
International audienceThis extended abstract is dedicated to the analysis of the height of non-plane...
AbstractWe study the height of the binary search tree—the most fundamental data structure used for s...
AbstractBy using analytic tools it is shown that the variance E(Hn−EHn)2 of the height Hn of binary ...
AbstractWe show that binary search trees of a given size tend to have smaller height when the root d...
AbstractLet Cn denote the number of nodes in a random binary search tree (of n nodes) at the maximal...
International audienceWe consider a (random permutation model) binary search tree with $n$ nodes and...
Abstract. It is shown that all centralized absolute moments E|Hn − EHn | α (α ≥ 0) of the height Hn ...
AbstractThe class ⊤ of binary search trees is studied. A leaf is a vertex of degree 0; ⊤n is the sub...
Abstract. We study the effect of a well-known balancing heuristic on the expected height of a random...
For random trees T generated by the binary search tree algorithm from uniformly distributed input we...
. The number of descendants of a node in a binary search tree (BST) is the size of the subtree havin...
AbstractThis paper characterizes binary trees with n leaves, which have the greatest number of subtr...
Binary search trees are one of the most fundamental data structures. While the height of such a tree...
We study numerically a non-linear integral equation that arises in the study of binary search trees....
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
International audienceThis extended abstract is dedicated to the analysis of the height of non-plane...
AbstractWe study the height of the binary search tree—the most fundamental data structure used for s...
AbstractBy using analytic tools it is shown that the variance E(Hn−EHn)2 of the height Hn of binary ...
AbstractWe show that binary search trees of a given size tend to have smaller height when the root d...
AbstractLet Cn denote the number of nodes in a random binary search tree (of n nodes) at the maximal...
International audienceWe consider a (random permutation model) binary search tree with $n$ nodes and...
Abstract. It is shown that all centralized absolute moments E|Hn − EHn | α (α ≥ 0) of the height Hn ...
AbstractThe class ⊤ of binary search trees is studied. A leaf is a vertex of degree 0; ⊤n is the sub...
Abstract. We study the effect of a well-known balancing heuristic on the expected height of a random...
For random trees T generated by the binary search tree algorithm from uniformly distributed input we...
. The number of descendants of a node in a binary search tree (BST) is the size of the subtree havin...
AbstractThis paper characterizes binary trees with n leaves, which have the greatest number of subtr...
Binary search trees are one of the most fundamental data structures. While the height of such a tree...
We study numerically a non-linear integral equation that arises in the study of binary search trees....
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
International audienceThis extended abstract is dedicated to the analysis of the height of non-plane...
Add to ORKG