- Array -- Heap Sort -- QuickSort -- Identifying Kth Highest/Lowest from an array -- Linear Search -- Binary Search -- Merge two sorted arrays
- Queue implementation using -- Circular array -- Circular Linked List -- Two stacks
- Tree Traversal -- InOrder -- PreOrder -- PostOrder -- ReverseInOrder
- Trie implementation using Nested Dictionary
- Graph implementation using Dictionary of Dictionary -- Depth First Traversal -- Breadth First Traversal
-
Notifications
You must be signed in to change notification settings - Fork 0
Reinventing wheel in Data Structure with C#. Includes implementations for generic LinkedList, Queue implementation using Circular array/Linked List, Trie, Tree Traversal, Priority Queue, Heap Sort, QuickSort, Kth Highest/Lowest, fundamentals of Graph with BFS and DFS.
bikashjoshi/data-structure-csharp
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Reinventing wheel in Data Structure with C#. Includes implementations for generic LinkedList, Queue implementation using Circular array/Linked List, Trie, Tree Traversal, Priority Queue, Heap Sort, QuickSort, Kth Highest/Lowest, fundamentals of Graph with BFS and DFS.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published