MSDN has serveral articles that discuss data structures using C# 2.0:
- Data Structures Using C# 2.0, Part 1 : the Array and List.
- Data Structures Using C# 2.0, Part 2: the Queue, the Stack, and the Hashtable.
- Data Structures Using C# 2.0, Part 3: Binary trees. A binary search tree, or BST, allows for a much more optimized search time than with unsorted arrays.
- Data Structures Using C# 2.0, Part 4: AVL trees and red-black trees, which are two different self-balancing binary search tree data structures. He also covers skip lists, an ingenious data structure that turns a linked list into a data structure that offers the same running time as the more complex self-balancing tree data structures.
- Data Structures Using C# 2.0, Part 5: Graphs, a collection of nodes and edges with no rules dictating the connection among the nodes, and one of the most versatile data structures.
- Data Structures Using C# 2.0, Part 6: The set, which is an unordered collection of unique items that can be enumerated and compared to other sets in a variety of ways.
Read more here.