← Back to blog

left leaning red black 2-3 binary search tree deletion

By Paras Mittal
Published December 19, 2025

While studying for Purdue's CS 251, I found the deletion algorithm for 2-3 LLRBs a hassle.

Despite studying the inventors own paper, i still struggled. So I built a website to help walk through the steps one by one.

check it out!

trees.parasmittal.com