Deleting Arbitrary Values from Binary Search Trees
Binary Search Tree’s are great. A couple dozen lines of code yields you with an
An Abstract Memory Store
In my previous post I went over one possible scheme for an Object structure suitable
Implementing Dynamic Typing with Tagged Unions
Many scripting languages, if not most of them, have dynamic typing. where you don’t need
Deterministic Skip Lists
The Skip List, introduced in 1990 by Pugh[1] is an interesting data structure. Skip lists
Top-Down 2-3-4-5 Trees: The Red/Black Tree time forgot
The 1978 paper “A Dichromatic Framework for Balanced Trees” by Guibas and Sedgewick[1] in which
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
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
Data Structure Visualization Revisited
As I’ve mentioned in previous posts I am keenly interested in methods of generating visual
Roll your own String type
Anyone who has ever had the pleasure of working with ‘C style’ strings aka NULL
Implementing Interfaces in C++ with Virtual Classes
Many newer object oriented languages such as Java and Swift have a dedicated interface type