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 sections on implementing Red/Black Tree's. Almost all of them begin with an introduction to 2-3-4 tree's. In addition, almost all of them detail algorithms that restructure the t

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 of sounding like some kind of evangelist: If you're going to insist on implementing your own containers, you must implement iterators for them. I won't repeat my entire diatribe on the

Applying the Iterator Pattern to In-Memory B+ Trees

Memory Resident B+ Trees

Since Bayer & McCreight introduced the family of balanced search tree's collectively known as "B Trees" in their 1972 paper[1], they have traditionally been used as a data structure for external storage devices, which is why they are very often use

Compressed Tries: a Space Efficient key-string Store

Ah tries, the tree structure with a name that nobody can agree on how to pronounce. Oddly spelled name aside, Tries offer a convenient way to implement a collection of strings in a way which supports operations such as finding the longest common prefix

Search
Recent Posts
Meta