Balanced Search Trees Made Simple

Abstract. As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenancealgorithms for balanced trees. In terms of code simplicity, our algorithms compare favourably with those for deterministic and probabilistic skip lists.

• Type: Conference
• Year: 1993
• Where: WADS
• Authors: Arne Andersson
• Keywords: Algorithms, Balanced Trees, Probabilistic Skip Lists, Simple Implementations, WADS 1993