Partitioned Binary Search Trees: A Generalization of Red Black Trees

Zouana, Seyfeddine; Zegour, Djamel Eddine

doi:10.13053/cys-23-4-3108

Search citation statements

Order By: Relevance

Paper Sections

Select...

The Worst Case Height Is1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2023

Publication Types

Select...

Preprint1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We will show in section 6, some experimental results that confirm this. More information can be found at [21]. [22] deals with an extension of the Red-Black trees using three colors.…”

Section: The Worst Case Height Ismentioning

confidence: 99%

M-PBBST(n1, n2) : Multiple Partially Balanced Binary Search Trees in one

Eddine

2023

Preprint

View full text Add to dashboard Cite

In this paper, we present a new binary search tree to generate known data structures such as Red-Black trees, AA trees, 2–3 trees and several other very interesting data structures that are unknown to us. The proposed data structure partitions the elements of a binary search tree into unbalanced sub-trees of heights ranging from n1 to n2-1 (0 ≤ n1 ≤ n2-2 & n2 > 1). The algorithms are simple and use only a few extra bits of storage at the tree node. Moreover, a single code covers all generated data structures and the worst case height is

show abstract

“…We will show in section 6, some experimental results that confirm this. More information can be found at [21]. [22] deals with an extension of the Red-Black trees using three colors.…”

Section: The Worst Case Height Ismentioning

confidence: 99%