[quoted text, click to view]

Nope. But if you really meant a binary search tree then the
SortedDictionary fits the bill. It's implemented as a red black tree.

[quoted text, click to view]

Sorry, you'll have to google for the different algorithms. I've never
needed to implement my own since they have properties that make them
more useful when dealing with secondary storage devices (e.g. file
systems and databases).

Is it any class which implements b-tree in .NET 2005?

How implements b-tree if this class not exists in .NET 2005?