Fibonacci BSTs: a new balancing method for binary search trees

DOI10.1016/J.TCS.2012.11.027zbMATH Open1291.68156OpenAlexW2133945633MaRDI QIDQ390913FDOQ390913

Authors: Salvador Roura 

Publication date: 9 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.027

Recommendations

• scientific article; zbMATH DE number 1754613
• A new weight balanced binary search tree
• scientific article; zbMATH DE number 96112
• A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
• Path balance heuristic for self-adjusting binary search trees
• Algorithms and Computation
• A new representation of binary search trees
• An analytic approach for the analysis of rotations in fringe-balanced binary search trees
• scientific article; zbMATH DE number 2105039

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Self-adjusting binary search trees
• Binary Search Trees of Bounded Balance
• Randomized binary search trees
• Title not available (Why is that?)

Cited In (2)

• Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking
• Title not available (Why is that?)

This page was built for publication: Fibonacci BSTs: a new balancing method for binary search trees

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