📚 Data Structures in C#

This repository contains implementations of fundamental Data Structures using C#, organized into folders by category.
It is designed for learning, practicing, and building a strong foundation in Data Structures.

---

📂 Project Structure

• Binary Search Tree (BST) → Implementation of BST with insertion, deletion, and traversal.
• Binary Tree → General Binary Tree with traversal methods.
• Circular Queue → Queue implementation with circular behavior.
• dbLinked List → Doubly Linked List implementation.
• Graph → Graph using Adjacency Matrix & Adjacency List + Traversals (DFS & BFS).
• Hash Tables → Implementation of hash tables with collision handling.
• Linked List → Singly Linked List implementation.
• Queue using Linked List → Queue operations built using a Linked List.
• Stack using Array → Stack implementation using arrays.
• Tree → Additional tree-related operations and examples.
• Heap → Min-Heap and Max-Heap implementation.
• Priority Queue → Priority Queue implementation with Min-Heap.

---

🚀 How to Run

1. Clone the repository:

   https://github.com/AbdullahEweida/Data-Structure-using-Csharp/edit/main/README.md