Aspects of insertion in random trees

DOI10.1007/BF02254848zbMATH Open0477.68062OpenAlexW2132795833MaRDI QIDQ1160488FDOQ1160488

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

• Title not available (Why is that?)
• On random 2-3 trees
• Binary Search Trees of Bounded Balance
• Title not available (Why is that?)
• On the average number of rebalancing operations in weight-balanced trees
• A Naturally Occurring Function Continuous Only at Irrationals
• A Partial Analysis of Random Height-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)