A Simple Balanced Search Tree with No Balance Criterion

TL;DR

This paper introduces a highly simple and intuitive balanced binary search tree method that does not rely on any balance criterion, requiring minimal code and suitable for scenarios where amortized logarithmic performance suffices.

Contribution

The paper proposes a novel balanced search tree approach that avoids traditional balance criteria, emphasizing simplicity and minimal implementation complexity.

Findings

Achieves balanced search tree properties without explicit balance checks

Requires minimal additional code and a simple partial-rebuilding algorithm

Suitable for applications tolerating amortized logarithmic costs

Abstract

We present a method that maintains a balanced binary search tree without using any tree balance criterion at all, with the ultimate aim of maximum simplicity. In fact, our method is highly intuitive, and we only need to add minimal extra code and a simple partial-rebuilding algorithm to a naive binary search tree. Our method will be suitable as a highly simple and short solution when amortized logarithmic costs are enough.