This page provides some supplementary material for the following publication:

Ghiasi-Shirazi, Kamaledin, Taraneh Ghandi, Ali Taghizadeh, and Ali Rahimi-Baigi. Revisiting 2-3 Red-Black Trees with a Pedagogically Sound Yet Efficient Deletion Algorithm: Parity-Seeking. Acta Informatica, Volume 00, Issue 00, pp 0000–0000, 2024. (link)

Implementation:


https://github.com/k-ghiasi/RedBlackTrees

Detailed execution steps of different red-black tree algorithms:

Insert algorithm of CLRS
Delete algorithm of CLRS

Insert algorithm of LLRB
Delete algorithm of LLRB (Part I)
Delete algorithm of LLRB (Part II)

Insert algorithm of 2-3 Red-Black Trees
Parity-Seeking insert algorithm of 2-3 Red-Black Trees
Parity-Seeking delete algorithm of 2-3 Red-Black Trees

Insert algorithm of 2-3-4 Red-Black Trees (The same as CLRS)
Parity-Seeking insert algorithm of 2-3-4 Red-Black Trees
Parity-Seeking delete algorithm of 2-3-4 Red-Black Trees