A note on the height of binary search trees

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

An analytic approach to the height of binary search trees
scientific article; zbMATH DE number 1741002
On the concentration of the height of binary search trees
scientific article; zbMATH DE number 3904610
An analytic approach to the height of binary search trees. II
Binary search trees of almost optimal height
The height of a random binary search tree
On Finding the Height of a Binary Search Tree
scientific article; zbMATH DE number 3847416
scientific article; zbMATH DE number 4023312

Cited in

(only showing first 100 items - show all)

Random sequential bisection and its associated binary tree
Branching processes in the analysis of the heights of trees
Applications of the theory of records in the study of random trees
Efficient algorithms for parallel sorting on mesh multicomputers
On the expected height of fringe-blanced trees
A note on the growth of random trees
A note on the asymptotic behavior of the heights in \(b\)-trees for \(b\) large
Constant bounds on the moments of the height of binary search trees
General Edgeworth expansions with applications to profiles of random trees
On weighted depths in random binary search trees
On the Lambert \(w\) function
The properties of random trees
An analytic approach to the height of binary search trees
The height of a binary search tree: the limiting distribution perspective.
Extreme value statistics and traveling fronts: Various applications
The profile of binary search trees
Analytic methods in asymptotic enumeration
Randomized search trees
The height of Mallows trees
Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
Correction terms for the height of weighted recursive trees
Towards convergence rate analysis of random forests for classification
The variance of the average depth of a pure birth process converges to 7
Average case analysis for tree labelling schemes
Smoothed analysis of binary search trees
Average-case analysis of quicksort and binary insertion tree height using incompressibility
Long and short paths in uniform random recursive dags
Search trees: metric aspects and strong limit theorems
Random binary trees: from the average case analysis to the asymptotics of distributions
Limiting theorems for the nodes in binary search trees
Behavior near the extinction time in self-similar fragmentations. II: Finite dislocation measures.
Martingales and large deviations for binary search trees
D E K=(100)_8
Depth properties of scaled attachment random recursive trees
A note on the Horton-Strahler number for random binary search trees
Almost sure asymptotics for the random binary search tree
On the Most Likely Voronoi Diagram and Nearest Neighbor Searching
Random records and cuttings in binary search trees
A phase transition for the heights of a fragmentation tree
Longest path distance in random circuits
An Improved Bound for Random Binary Search Trees with Concurrent Insertions
Limit laws for local counters in random binary search trees
EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
An analytic approach to the height of binary search trees. II
Average depth in a binary search tree with repeated keys
Fast error-tolerant quartet phylogeny algorithms
Retracted: Strong limiting behavior in binary search trees
On the height of random m‐ary search trees
On Finding the Height of a Binary Search Tree
Universal Limit Laws for Depths in Random Trees
A study of random Weyl trees
On the internal path length ofd-dimensional quad trees
The Height and Size of Random Hash Trees and Random Pebbled Hash Trees
On random cartesian trees
Note on the heights of random recursive trees and random m‐ary search trees
ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
scientific article; zbMATH DE number 1741002 (Why is no real title available?)
scientific article; zbMATH DE number 1984548 (Why is no real title available?)
Random suffix search trees
scientific article; zbMATH DE number 2038884 (Why is no real title available?)
An almost sure result for path lengths in binary search trees
One-sided variations on interval trees
scientific article; zbMATH DE number 1545682 (Why is no real title available?)
On the concentration of the height of binary search trees
Erasure-Resilient Property Testing
Hypergeometrics and the cost structure of quadtrees
On the Generation of Random Binary Search Trees
Partition functions of discrete coalescents: from Cayley's formula to Frieze's (3) limit theorem
Lock-free search data structures: throughput modeling with Poisson processes
DEGREE-BASED GINI INDEX FOR GRAPHS
On a random search tree: asymptotic enumeration of vertices by distance from leaves
Search problems in groups and branching processes.
The height of random k‐trees and related branching processes
Oscillations in the height of the Yule tree and application to the binary search tree
Numerical studies of the expected height in randomly built binary search trees
Uniform distribution modulo one and binary search trees
The height of increasing trees
Optimal binary search trees
The variance of the height of binary search trees
The height of record‐biased trees
The effects of semantic simplifications on random \textit{BST}-like expression-trees
Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
Maximal flow in branching trees and binary search trees
Combinatorial differential operators in: Faà di Bruno formula, enumeration of ballot paths, enriched rooted trees and increasing rooted trees
Leveraging parameterized Chernoff bounds for simplified algorithm analyses
Binary search trees of permuton samples
Deciding sparseness of regular languages of finite trees and infinite words
Binary search trees of permuton samples
On fluctuations of complexity measures for the FIND algorithm
Average-case analysis on simple families of trees using a balanced probability model
Tree height and the asymptotic mean of the Colijn-Plazzotta rank of unlabeled binary rooted trees
Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
On Robson's convergence and boundedness conjectures concerning the height of binary search trees
Absorbing patterns in BST-like expression-trees
Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
Heights of butterfly trees
Optimal parallel quicksort on EREW PRAM
Binary search trees of almost optimal height
Weighted height of random trees
On the silhouette of binary search trees

This page was built for publication: A note on the height of binary search trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990603)