Here, we derive the exact mean and variance of the number of weakly protected nodes (the nodes that are not leaves and at least one of their children is not a leaf) in binary search trees grown from random permutations. Furthermore, by using contraction method, we prove normal limit law for a properly normalized version of this tree parameter
AbstractBy using analytic tools it is shown that the variance E(Hn−EHn)2 of the height Hn of binary ...
In this paper we present randomized algorithms over binary search trees such that: a) the insertion ...
In a rooted tree, protected nodes are neither leaves nor parents of any leaves. They have some pract...
AbstractWe derive exact moments of the number of 2-protected nodes in binary search trees grown from...
We study protected nodes inm-ary search trees, by putting them in context of gen-eralised Pólya urn...
We study protected nodes inm-ary search trees, by putting them in context of gen-eralised Pólya urn...
In a randomly grown binary search tree (BST) of size n, any fixed pattern occurs with a frequency th...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
This paper studies path lengths in random binary search trees under the random permutation model. It...
AbstractWe present a detailed study of left–right-imbalance measures for random binary search trees ...
We study maximal clades in random phylogenetic trees with the Yule–Harding model or, equivalently, i...
. The number of descendants of a node in a binary search tree (BST) is the size of the subtree havin...
We study protected nodes in various classes of random rooted trees by putting them in the general co...
Binary search trees are one of the most fundamental data structures. While the height of such a tree...
AbstractBy using analytic tools it is shown that the variance E(Hn−EHn)2 of the height Hn of binary ...
In this paper we present randomized algorithms over binary search trees such that: a) the insertion ...
In a rooted tree, protected nodes are neither leaves nor parents of any leaves. They have some pract...
AbstractWe derive exact moments of the number of 2-protected nodes in binary search trees grown from...
We study protected nodes inm-ary search trees, by putting them in context of gen-eralised Pólya urn...
We study protected nodes inm-ary search trees, by putting them in context of gen-eralised Pólya urn...
In a randomly grown binary search tree (BST) of size n, any fixed pattern occurs with a frequency th...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
This paper studies path lengths in random binary search trees under the random permutation model. It...
AbstractWe present a detailed study of left–right-imbalance measures for random binary search trees ...
We study maximal clades in random phylogenetic trees with the Yule–Harding model or, equivalently, i...
. The number of descendants of a node in a binary search tree (BST) is the size of the subtree havin...
We study protected nodes in various classes of random rooted trees by putting them in the general co...
Binary search trees are one of the most fundamental data structures. While the height of such a tree...
AbstractBy using analytic tools it is shown that the variance E(Hn−EHn)2 of the height Hn of binary ...
In this paper we present randomized algorithms over binary search trees such that: a) the insertion ...
In a rooted tree, protected nodes are neither leaves nor parents of any leaves. They have some pract...
DOI
Add to ORKG