Toward a Unique Representation for AVL and Red-Black Trees

Bounif, Lynda; Zegour, Djamel Eddine

doi:10.13053/cys-23-2-2840

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Preprint1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the framework's drawback was its separate rules for defining commonly used balanced trees. This was addressed by Bounif and Zegour (2019), which presented a unified representation for both AVL and RB Trees. In addition, Zegour (2018, 2019) introduced the Red Green Black Trees which is an extension to RB Trees.…”

Section: Introductionmentioning

confidence: 99%

Partitioned Trees

Meguellati

Zegour

Zouana

2023

Preprint

Self Cite

View full text Add to dashboard Cite

We introduce the Partitioned Trees, a form of Partitioned Binary Search Tree parameterized to represent both Red-Black trees and a family of partially balanced Binary Search Trees. Partitioned Tree is interesting not only because it provides the same time and space complexity as Balanced Binary Search trees O(logn), but also because it’s simple to implement, easily understandable, and highly adaptable in different fields where rebalancing is costly. We outline the various maintenance operations and insertion and deletion algorithms employed by the proposed data structure. Additionally, we conduct an in-depth analysis on the worst-case height of Partitioned Trees followed by a comparison of Partitioned Trees and Red-Black Trees. Our simulations confirm that Partitioned Trees exhibit superior performance compared to Red-Black Trees.

show abstract

Section: Introductionmentioning

confidence: 99%