M-PBBST(n1, n2) : Multiple Partially Balanced Binary Search Trees in one

Abstract

In this paper, we present a new binary search tree to generate known data structures such as Red-Black trees, AA trees, 2–3 trees and several other very interesting data structures that are unknown to us. The proposed data structure partitions the elements of a binary search tree into unbalanced sub-trees of heights ranging from n1 to n2-1 (0 ≤ n1 ≤ n2-2 & n2 > 1). The algorithms are simple and use only a few extra bits of storage at the tree node. Moreover, a single code covers all generated data structures and the worst case height is