Deletion without rebalancing in balanced binary trees

MaRDI QIDQ5417725zbMATH OpenFDO

Authors Siddhartha Sen, Robert E. Tarjan

Publication date 22 May 2014

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Deletion without rebalancing in binary search trees
• scientific article; zbMATH DE number 3928331
• Deletion without rebalancing in multiway search trees
• Deletion without rebalancing in multiway search trees
• Rank-Balanced Trees

Cited in

(14)

• Exponentially decreasing number of operations in balanced trees
• Deletion: The curse of the red-black tree
• Deletion without rebalancing in multiway search trees
• Amortized Complexity of Bulk Updates in AVL-Trees
• scientific article; zbMATH DE number 437541 (Why is no real title available?)
• Deletion without rebalancing in non-blocking binary search trees
• Rank-Balanced Trees
• Maintenance of the pre-large trees for record deletion
• Deletion without rebalancing in multiway search trees
• scientific article; zbMATH DE number 3928331 (Why is no real title available?)
• On deletion in threaded binary trees
• UPDATING BINARY TREES WITH CONSTANT LINKAGE COST
• Deletion without rebalancing in binary search trees
• On k-dimensional balanced binary trees.

This page was built for publication: Deletion without rebalancing in balanced binary trees

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