Partitioned Binary Search Trees: A Generalization of Red Black Trees

Authors

  • Seyfeddine Zouana Ecole nationale Superieure d'Informatique ESI
  • Djamel Eddine Zegour Ecole nationale Superieure d'Informatique ESI

DOI:

https://doi.org/10.13053/cys-23-4-3108

Keywords:

Red black trees, B-Trees, generalization, relaxation

Abstract

We propose a generalized form for Red Black Trees. The structure, called Partitioned Binary Search Trees, tolerates finite successions of Red nodes provoking a degree of imbalance while reducing the number of maintenance operations and speeding up the updates. The tree is interesting not only because of its simple operations but also because it insures the same level of performance of Red Black Trees O(log(n)) and allows an even higher adaptability and efficiency rate in different fields where rebalancing is costly.

Author Biographies

Seyfeddine Zouana, Ecole nationale Superieure d'Informatique ESI

PhD Student at Laboratoire de la Communication dans les Systemes Informatiques, Ecole nationale Superieure d'Informatique

Djamel Eddine Zegour, Ecole nationale Superieure d'Informatique ESI

Full ProfessorLaboratoire de la Communication dans les Systemes InformatiquesEcole nationale Superieure d'Informatique

Downloads

Published

2019-12-20

Issue

Section

Articles