Comments on: Implementing a Red-Black Tree in C#

By: Binary Search Tree and Red-Black Tree in C# « SeeSharpSoft[dot]NET

Binary Search Tree and Red-Black Tree in C# « SeeSharpSoft[dot]NET — Sun, 04 Oct 2009 00:28:20 +0000

[...] these articles: Working with Red-Black Trees in C#, An Extensive Examination of Data Structures and Implementing a Red-Black Tree in C#. While the first seems to be exactly what i was looking for provides the second article on MSN some [...]

By: Sam

Sam — Tue, 16 Dec 2008 00:00:45 +0000

Jack, excellent post. I enjoyed it. I would like to see benchmarks, which they always show in Algorithms textbooks. Also, shorter paragraphs would be easier. Thanks.

By: Kalyan

Kalyan — Sat, 13 Dec 2008 06:24:48 +0000

Great post. Very useful & informative. Thanks a lot.

By: cowgaR

cowgaR — Fri, 12 Dec 2008 11:52:53 +0000

not only this is GREAT article, you are also a GREAT teacher!

wish you would post more often, a definitive kick!

By: Thomas Hilbert Madsen

Thomas Hilbert Madsen — Wed, 10 Dec 2008 15:44:28 +0000

I can recommend Wintellect PowerCollections if you quick need access to basic standard data structures and algorithms.

By: Scott

Scott — Wed, 10 Dec 2008 05:29:39 +0000

In addition to SortedDictionary, DataTables are also RedBlack based