Locally balanced binary trees
From MaRDI portal
Publication:4109291
DOI10.1093/comjnl/19.4.322zbMath0341.68026OpenAlexW2110042562MaRDI QIDQ4109291
No author found.
Publication date: 1976
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/19.4.322
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Trees (05C05) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
On rotations in fringe-balanced binary trees ⋮ Fast updating of well-balanced trees ⋮ The asymptotic distribution of cluster sizes for supercritical percolation on random split trees ⋮ Height balance distribution of search trees ⋮ The fluctuations of the giant cluster for percolation on random split trees ⋮ Inversions in Split Trees and Conditional Galton–Watson Trees ⋮ Measuring tree balance using symmetry nodes -- a new balance index and its extremal properties ⋮ Universal Limit Laws for Depths in Random Trees ⋮ An analytic approach for the analysis of rotations in fringe-balanced binary search trees ⋮ Average number of rotations access cost in iR-trees ⋮ On the expected height of fringe-blanced trees
