lethalsage / dsa

some important algorithm in DSA

---

Discover the World of Data Structures and Algorithms (DSA) 🌐

Welcome to my DSA repository! Here, I'm studying Data Structures and Algorithms as part of my university studies. Feel free to explore, learn, and even fork this repository to dive into the algorithms I'm mastering.

Let's embark on a journey of discovery together, Join me in this exploration, and let's elevate our programming skills to new heights! 🚀

---

Here is the directory structure

DSA Repository
│
├── Arrays
│ ├── Array Operations
│ │ ├── Insertion Sort
│ │ ├── Selection Sort
│ │ ├── Bubble Sort
│ │ ├── Merge Sort
│ │ ├── Quick Sort
│ │ ├── Bucket Sort
│ │ ├── Counting Sort
│ │ ├── Radix Sort
│ │ └── Integer Sorting
│ │
│ └── Dynamic Arrays
│ ├── Resizing Operations
│ └── Dynamic Array Implementation
│
├── Linked Lists
│ ├── Singly Linked List
│ │ ├── Insertion Operations
│ │ ├── Deletion Operations
│ │ ├── Traversal
│ │ └── Reversal
│ │
│ ├── Doubly Linked List
│ │ ├── Insertion Operations
│ │ ├── Deletion Operations
│ │ ├── Traversal
│ │ └── Reversal
│ │
│ └── Circular Linked List
│ ├── Insertion Operations
│ ├── Deletion Operations
│ ├── Traversal
│ └── Reversal
│
├── Stacks
│ ├── Stack Implementation
│ ├── Stack Operations
│ ├── Applications (e.g., Expression Evaluation)
│ └── Infix, Prefix, and Postfix Notations
│
├── Queues
│ ├── Queue Implementation
│ ├── Queue Operations
│ ├── Circular Queue
│ ├── Priority Queue
│ └── Applications (e.g., BFS in Graphs)
│
├── Trees
│ ├── Binary Trees
│ │ ├── Binary Tree Traversal
│ │ ├── Binary Search Trees
│ │ │ ├── Insertion and Deletion Operations
│ │ │ ├── Searching Operations
│ │ │ └── AVL Trees
│ │ │ ├── AVL Tree Rotations
│ │ │ └── Balancing Operations
│ │ │
│ │ └── Huffman Trees
│ │ ├── Huffman Encoding
│ │ └── Huffman Decoding
│ │
│ ├── Heap
│ │ ├── Max Heap
│ │ │ ├── Heapify
│ │ │ ├── Heap Insertion
│ │ │ └── Heap Deletion
│ │ │
│ │ └── Min Heap
│ │ ├── Heapify
│ │ ├── Heap Insertion
│ │ └── Heap Deletion
│ │
│ └── Other Tree Structures
│ ├── N-ary Trees
│ ├── B-trees
│ └── Trie
│
└── Graphs
├── Graph Representation (Adjacency Matrix, Adjacency List)
├── Graph Traversal (DFS, BFS)
├── Shortest Path Algorithms (Dijkstra's, Bellman-Ford)
├── Minimum Spanning Tree (Prim's, Kruskal's)
├── A* Algorithm
└── Graph Applications (e.g., Topological Sorting, Network Flow)

Certain algorithms need to be completed, while others have already been updated.😊