If you haven't been keeping track of this running series of articles on MSDN by Scott Mitchell, then you are really missing out. Building a Better Binary Search Tree is Part 4 in an excellent series of articles on Data Structures in .NET.

Part 1 introduces the very basic data structures. Part 2 talks about the Queue, Stack and Hashtable classes built into .NET. Part 3 discusses Binary Trees and Binary Search Trees (which are not built into .NET) and gives example code for your own implementation.

This latest article in the series improves on the Binary Search Tree from Part 3, by discussing self-balancing binary search trees, and then goes on to discuss skip lists. For anyone who had a really crappy prof in college for your Data Structures course, this is a must read series.