Updating approximately complete trees

DOI10.1051/ITA/1994280504311MaRDI QIDQ4365019zbMATH OpenOpenAlexFDO

Authors Tony W. Lai, D. Wood

Publication date 30 October 1997

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92489

zbMATH Keywords

binary search tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4205969
• Fast updating of well-balanced trees
• Binary search trees of almost optimal height
• A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
• UPDATING BINARY TREES WITH CONSTANT LINKAGE COST

Cites work

• Binary Search Trees of Bounded Balance
• Dynamic multi-dimensional data structures based on quad- and k-d trees
• scientific article; zbMATH DE number 4205969 (Why is no real title available?)
• scientific article; zbMATH DE number 140484 (Why is no real title available?)
• The design of dynamic data structures
• Updating approximately complete trees

Cited in

(4)

• scientific article; zbMATH DE number 4205969 (Why is no real title available?)
• Updating approximately complete trees
• Fast updating of well-balanced trees
• Computer Aided Verification

This page was built for publication: Updating approximately complete trees

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