scientific article; zbMATH DE number 140484

MaRDI QIDQ4028903zbMATH OpenFDO

Authors

Publication date 28 March 1993

zbMATH Keywords

general balanced treesheight-balancingpartial rebuilding

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Maintaining α-balanced trees by partial rebuilding
• General Balanced Trees
• Balancing binary trees by internal path reduction
• DYNAMIC TREE REBALANCING USING RECURRENT ROTATIONS: DYNAMIC TREE REBALANCING
• A TOP-DOWN UPDATING ALGORITHM FOR WEIGHT-BALANCED TREES

Cited in

(10)

• Maintaining α-balanced trees by partial rebuilding
• General Balanced Trees
• Updating approximately complete trees
• Parallel dynamic lowest common ancestors
• Verified Root-Balanced Trees
• Fast updating of well-balanced trees
• Fast algorithms via dynamic-oracle matroids
• Bottom-up rebalancing binary search trees by flipping a coin
• Online list labeling: breaking the ^2n barrier
• Root-Balanced Tree

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 Q4028903)