scientific article; zbMATH DE number 4064505

zbMATH Open0652.68074MaRDI QIDQ3798255FDOQ3798255

Authors: R. P. Cheetham, B. John Oommen, David T. H. Ng 

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• Efficient reorganization of binary search trees
• Construction of optimal binary split trees in the presence of bounded access probabilities
• Optimal binary search trees
• Self-adjusting binary search trees
• Assembling approximately optimal binary search trees efficiently using arithmetics

zbMATH Keywords

binary search tree

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Cited In (4)

• Lower Bounds for Accessing Binary Search Trees with Rotations
• Efficient reorganization of binary search trees
• Optimal binary search trees
• Self-Organizing Heuristics for Implicit Data Structures

This page was built for publication:

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