Skip to content

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.

Notifications You must be signed in to change notification settings

bikashjoshi/data-structure-csharp

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

data-structure-csharp

Includes

  • 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

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

No packages published

Languages