Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{174347,
        author = {Bhavyanshika Gupta and Pankaj Kumar Gupta and P. K. Tyagi and R. K. Agrawal},
        title = {Analysis of Mathematical Properties & Development of Parallel Algorithms for Optimized Red-Black and AVL Trees in High-Performance Computing},
        journal = {International Journal of Innovative Research in Technology},
        year = {2025},
        volume = {11},
        number = {10},
        pages = {4357-4368},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=174347},
        abstract = {In computer science, self-balancing binary search trees are essential data structures that have the ability of effective data retrieval as well as efficient data storage. It has a self balancing mechanism which makes them stand out among most of the other trees. With an emphasis on insertion, deletion, rebalancing, height attributes, and their effects on performance, this study provides a thorough comparison of these two tree architectures. The paper explores the mathematical characteristics of tree height and rebalancing methods, contrasting the color-based strategy of Red-Black Trees with the height-based stringent balancing of AVL Trees. Particular focus is given on the contrast between the self-balancing mechanisms of both the trees where AVL is height balanced tree and Red Black is a color-balanced tree. 
In dynamic data settings, experimental results show the trade-offs between the frequency of rebalancing procedures and the ensuing structural stability. This study sheds the light on the best use cases for each type of tree and give helpful suggestions for putting them into practice in real-world applications that need scalable and effective data management.},
        keywords = {Red Black, AVL, Self Balancing BST.},
        month = {March},
        }