Aspects of insertion in random trees

DOI10.1007/BF02254848MaRDI QIDQ1160488zbMATH OpenOpenAlexFDO

Authors Amitava Bagchi, Edward M. Reingold

Publication date 1982

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02254848

zbMATH Keywords

AVL treesbinary searchheight-balanced treesweight-balanced treesinternal nodesdistribution of the weight- balance factorsweakly balanced trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• A Naturally Occurring Function Continuous Only at Irrationals
• A Partial Analysis of Random Height-Balanced Trees
• Binary Search Trees of Bounded Balance
• On random 2-3 trees
• On the average number of rebalancing operations in weight-balanced trees

Cited in

(1)

• Height balance distribution of search trees

This page was built for publication: Aspects of insertion in random trees

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