Average-case analysis on simple families of trees using a balanced probability model

DOI10.1016/0304-3975(93)90306-EzbMath0785.68044WikidataQ61734825 ScholiaQ61734825MaRDI QIDQ688684

M. C. Fu

Publication date: 6 December 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

occupancybinary search treeintersectionuniform modelbalanced model

Mathematics Subject Classification ID

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

Related Items (1)

The effects of semantic simplifications on random \textit{BST}-like expression-trees

Cites Work

• Complexity analysis of term-rewriting systems
• Singularity Analysis of Generating Functions
• On the Average Size of the Intersection of Binary Trees
• A note on the height of binary search trees
• On the Altitude of Nodes in Random Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Average-case analysis on simple families of trees using a balanced probability model