NONE 20260205075930735 wseas/wseas content-registration-form+ja@crossref.org content-registration-form WSEAS TRANSACTIONS ON COMPUTER RESEARCH 1991-8755 2415-1521 Djamel-Eddine Zegour Ecole Supérieure d’Informatique, LCSI Laboratory, BP 68M, Oued Smar, 16309, El Harrach, Alger, ALGERIA 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. 02 05 2026 02 05 2026 187 17 https://creativecommons.org/licenses/by/4.0/deed.en_US 10.37394/232018.2026.14.17 https://wseas.com/journals/cr/2026/a345118-006(2026).pdf Knuth, D. E. (1973). The art of computer programming. Vol III: Sorting and Searching, Addison Wesley, Reading, Mass. Aho A. V, J. E. Hopcroft, J. D. Ullman (1983). Data Structures and Algorithms. Addison Wesley, Reading, Mass. Sedgewick R. (2004): Fundamentals data structures. Addison – Wesley. 13th Printing. Brass P. (2008). Advanced Data Structures. Cambridge University Press. A. Drozdek, Data Structures and Algorithms in C++, 2nd ed. Pacific Grove, CA, USA: Brooks/Cole, 2001. Adel’son-Velskii, G. M., and Y. M. Landis (1962). An algorithm for the organization of information. Dokl. Akad. Nauk SSSR 146, pp. 263-266. Guibas, L.J. and Sedgewick R (1978). A Dichromatic Framework for Balanced Trees. Proceedings of the 19th Annual Symposium on Foundations of Computer Science, October 16- 18, 1978. Anderson A. Balanced Search trees made simple (1993). Workshop on algorithms and Data Structures, pages 60-71, Springer Verlag. Bayer R (1971). Binary B-Trees for virtual memory. Proc. ACM Sigifidet Workshop on data description, access and control, pp.219- 235. Bayer, R (1972). Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms. Acta Informatica 1(4):290-306, 1972. Stout Q. F. and WARREN B. L (1986). Tree Rebalancing in Optimal Time and Space. Communications of the ACM. Vol. 29 Number 9. Bayer, R. and E. M. McCreight (1972). Organization and maintenance of large ordered indices. Acta Informatica, 1:3, pp173-189. Zegour D.E, Partitioned Binary Search Trees (P(h)-BST): A Data Structure for Computer RAM; Book: Data Science with Semantic Technologies: Theory, Practice, and Application ‘Chapter 6), 2022, Willey.