most citedRevisiting 2-3 Red-Black Trees with a Pedagogically Sound yet Efficient Deletion Algorithm: The Parity-Seeking Delete Algorithm

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2020★ 2 cited

Revisiting 2-3 Red-Black Trees with a Pedagogically Sound yet Efficient Deletion Algorithm: The Parity-Seeking Delete Algorithm

Kamaledin Ghiasi-Shirazi, Taraneh Ghandi, Ali Taghizadeh +1

Red-black (RB) trees are one of the most efficient variants of balanced binary search trees. However, they have always been blamed for being too complicated, hard to explain, and n…