Abstract
A new data structure is suggested, which is made of two classes of nodes - simple nodes and class nodes. Class nodes create a perfectly balanced trees when considered exclusively, while simple nodes introduce a small imbalance. The new data structure is advantageous because: On one hand, it is equivalent to a Red-Black tree but has simpler algorithms. For those who are unaware, Red-black trees were designed to guarantee that all operations take logarithmic time, therefore, they are effective balanced binary search trees. By simplifying the algorithms and keeping the equivalence, the new structure is expected to offer better code readability and easier implementation in contrast with traditional Red-Black trees. And on the other hand, it is more powerful with deletion operations compared to the Red-Black trees delete algorithm. The deletion in Red-Black Trees may sometimes involve complicated cases to maintain balance and satisfy the various properties of the tree. But the new structure proposes a better algorithm for deletions and could then offer a better performance for applications relying heavily on deletions. Implementation of the given data structure allows you to develop software systems that can accommodate and retrieve large datasets.