Status: Being Updated
Occasionally I will decide to take a tutorial and
completely rewrite it. In such a case, the tutorial will be down briefly and replaced
with a temporary page such as this one. Binary Search Trees III will be separated
into multiple tutorials: AVL Trees, Red Black Trees, and Splay Trees, so that I
can include more information in each without being worried about the length of the
page. I intend to include more code, better descriptions, and more diagrams to better
serve my faithful readers. ;-)
In all honesty, the code was written in haste for
the last tutorial, and I recently found a disturbing (and subtle!) bug in the AVL
deletion algorithm. This was, of course, due to my trying to be too clever at simplifying
the algorithms and not noticing the problem in my tests. I have completely rewritten
the code for AVL trees using more care, and in the process decided to add more to
the tutorial. While I was at it, I decided to update the red black and splay tutorials
as well. Because they will be significantly longer, I'm also splitting the three
sections into three separate tutorials.
My initial estimate of a couple of weeks was extremely optimistic, seeing as how Eternally
Confuzzled has been missing a Splay tree tutorial for some time since I took this page
down. It's been many a month, but I promise that I'll get it to you. :-)
Top