Fibonacci BSTs: a new balancing method for binary search trees

DOI10.1016/j.tcs.2012.11.027zbMath1291.68156OpenAlexW2133945633MaRDI QIDQ390913

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

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-adjusting binary search trees
• Randomized binary search trees
• Binary Search Trees of Bounded Balance