  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.
