Bottom-up 2-3 Red/Black Trees: Let your red nodes lean how they want
Well, It appears January is the month of the Red/Black tree, because here I am
Validating Red/Black Trees
Red/Black Trees are ubiquitous in computer science, and anyone who has taken more than a
Bottom up Red/Black Trees: The simplicity of LLRB Trees, with none of the penalty.
On my shelf I have books by no less than 7 different authors that contain
Implementing the Iterator Pattern on Search Tree’s without Parent Pointers.
Two Posts on Iterators in a row? I know, I know. But at the risk
Applying the Iterator Pattern to In-Memory B+ Trees
Anyone who has implemented a collection has faced the dilemma of what to return to
Memory Resident B+ Trees
Since Bayer & McCreight introduced the family of balanced search tree’s collectively known as “B