2017/09/01 by Tae Woo Kim, Kim, Tae Woo
Computer Science · #Advanced Database Systems and Queries #Algorithms and Data Compression #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #E.1 #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.1709.00247
openalex publication_date 2017/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.