An analytic approach for the analysis of rotations in fringe-balanced binary search trees

DOI10.1007/BF01608487zbMath0936.68110MaRDI QIDQ1305200

Alois Panholzer, Prodinger, Helmut

Publication date: 18 May 2000

Published in: Annals of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

fringe balanced search tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (4)

Balancing \(m\)-ary search trees with compressions on the fringe ⋮ Combinatorial families of multilabelled increasing trees and hook-length formulas ⋮ Phase changes in randomm-ary search trees and generalized quicksort ⋮ Analytic urns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rotations in fringe-balanced binary trees
• Mathematics for the analysis of algorithms.
• Central limit theorems for urn models
• On the number of descendants and ascendants in random search trees
• Singularity Analysis of Generating Functions
• The analysis of a fringe heuristic for binary search trees
• Locally balanced binary trees

This page was built for publication: An analytic approach for the analysis of rotations in fringe-balanced binary search trees