Skip to content
All projects

Data Structure Implementations: C#

  • C#
  • Data Structures
  • Algorithms
  • .NET

Tech stack

  • C#
  • .NET
  • Visual Studio
View on GitHub

The Problem

Understanding fundamental data structures is essential for building efficient software. This series of projects implements core data structures from scratch in C#, demonstrating algorithmic thinking and efficient memory management.

Implementations

Dictionary — Hash-based key-value store with collision resolution, supporting O(1) average-case lookups for a student enrolment system.

Queue — Both linear and circular queue implementations, demonstrating FIFO operations with efficient memory utilisation for a customer service simulation.

Binary Search Tree (BST) — Dynamic insertion, deletion, and traversal (in-order, pre-order, post-order) with self-balancing techniques to maintain O(log n) operations.

Graph — Supporting both adjacency list and adjacency matrix representations, with BFS and DFS traversal algorithms implemented for a social network analysis use case.

Tech Stack

C#, .NET Framework, Visual Studio

Repositories