| Revista: | Computación y sistemas |
| Base de datos: | |
| Número de sistema: | 000560331 |
| ISSN: | 1405-5546 |
| Autors: | Bounif, Lynda1 Zegour, Djamel Eddine1 |
| Institucions: | 1École Nationale Supérieure d'Informatique d'Alger, Laboratoire de la Communication dans les Systèmes Informatiques, Alger. Argelia |
| Any: | 2019 |
| Període: | Abr-Jun |
| Volum: | 23 |
| Número: | 2 |
| Paginació: | 435-450 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Resumen en inglés | 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. |
| Disciplines | Ciencias de la computación |
| Paraules clau: | Procesamiento de datos |
| Keyword: | Balanced binary trees, Red-black trees, AVL trees, Binary search tree, Partitioning, Data structures, Data processing |
| Text complet: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
