Resumen

BOUNIF, Lynda  y  ZEGOUR, Djamel Eddine. Toward a Unique Representation for AVL and Red-Black Trees. Comp. y Sist. [online]. 2019, vol.23, n.2, pp.435-450.  Epub 10-Mar-2021. ISSN 2007-9737.  https://doi.org/10.13053/cys-23-2-2840.

We propose a unique representation of both AVL and Red-Black trees with the same time and space complexity. We describe all the maintenance operations and also the insertion and deletion algorithms. We give the implementation of the proposed tree and the results. We then make a comparison of the three structures. The simulation results confirm the performance of the new representation relatively to AVL and Red-Black trees.

Palabras llave : Balanced binary trees; red-black trees; AVL trees; binary search tree; partitioning; data structures.