Here is the listing of C# programming examples on Data Structures.
C# Examples on Different Types of Data Structures
A Linked List is a dynamic data structure which is made up of a sequence of nodes. A Binary Search Tree (BST) is a tree in which each vertex can hold upto 2 children. The left child must hold a value smaller than its own, and the right child must hold a value larger than its own. Stack is an abstract data type which represents a collection of elements. The two operations that can be performed on a stack are Push and Pop. Push operation keeps adding new elements into a stack. Pop operation removes the last element that was added onto a stack. The following programs implement a Binary Search Tree using Linked List, creates a Singly Linked Circular List, implements traversal in a Singly Linked List, implements a Stack with Push and Pop operations and creates an instance of StackTrace to get all frames.