Data Structures in C#

Data Structures in C#

This six-part series that focuses on important data structures and their use in application development. Also examines both built-in data structures present in the .NET Framework, as well as essential data structures we'll have to build ourselves. Part 1: An Introduction to Data Structures Focuses on defining what data structures are, how the efficiency of data structures is analyzed, and why this analysis is important. Part 2: The Queue, Stack, and Hashtable Examines three of the most commonly studied data structures: the Queue, the Stack, and the Hashtable. Part 3: Binary Tress and BSTs Looks at a common data structure that is not included in the .NET Framework Base Class Library: binary trees. Part 4: Building a Better Binary Search Tree Examination of AVL trees and red-black trees, which are two different self-balancing, binary search tree data structures, skip list data structure, 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 Part 5: From Trees to Graphs All about graphs, one of the most versatile data structures. Part 6: Efficiently Representing Sets Data structures for implementing general and disjoint sets. A set is an unordered collection of unique items that can be enumerated and compared to other sets in a variety of ways. Regards, Mitesh Mehta Microsoft Certified Professional miteshvmehta@gmail.com