📚 Data Structures 🚀

Welcome to the Data Structures repository! This project includes various data structures and algorithms, complete with code, examples, and explanations. 🎉

---

🌟 Features

• 📦 Stacks: Operations like Push, Pop, and Peek explained with examples.
• 🚃 Queues: Simple and Circular Queues with implementation.
• 🔗 Linked Lists: Singly, Doubly, and Circular Linked Lists with insertion, deletion, and traversal.
• 🌲 Trees: Binary Trees, Binary Search Trees, and traversal algorithms (Inorder, Preorder, Postorder).
• 🕸️ Graphs: Representations (Adjacency Matrix/List) and traversal techniques (BFS, DFS).
• 🔄 Sorting Algorithms: Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, and Merge Sort.

---

🗂️ Repository Structure

.
├── index.js
├── WEEK 13
│   ├── 1- palindrome.js
│   ├── 2-febunacci.js
│   ├── 3-anigram.js
│   ├── 4-twoSum.js
│   ├── 5-factorial.js
│   ├── 6-primeNumber.js
│   ├── 7-powerOfTwo.js
│   ├── ARRAY CONCEPT
│   │   ├── 10-sum.js
│   │   ├── 1-push.js
│   │   ├── 2-pop.js
│   │   ├── 3-shift.js
│   │   ├── 4-unshift.js
│   │   ├── 5-insertElement.js
│   │   ├── 6-deleteElement.js
│   │   ├── 7-reverse.js
│   │   ├── 8-max&min.js
│   │   └── 9-rotateArray.js
│   ├── LINKED LIST
│   │   ├── 1-singlyLinkedList.js
│   │   ├── 2-doublyLinkedList.js
│   │   ├── 3-circularLinkedList.js
│   │   ├── 4-sort.js
│   │   └── 5-duplicatesAndUnique.js
│   ├── SEARCHING ALGORITHM
│   │   ├── 1-linearSearch.js
│   │   └── 2-binorySearch.js
│   └── STRING CONCEPT
│       ├── 1-charAt.js
│       ├── 2-indexOf.js
│       ├── 3-concat.js
│       ├── 4-split.js
│       ├── 5-reverse.js
│       └── 6-freq.js
├── WEEK 14
│   ├── HASH TABLE
│   │   ├── Open Addressing
│   │   │   ├── 1-linearProbing.js
│   │   │   └── 2-
│   │   └── Separate Chaining
│   │       ├── 1-array.js
│   │       └── 2-linkedList.js
│   ├── QUEUE ALGORITHM
│   │   ├── 1-basic.js
│   │   └── 2-stackUsingQueue.js
│   ├── SORTING ALGORITHM
│   │   ├── 1-bubbleSort.js
│   │   ├── 2-insertionSort.js
│   │   ├── 3-selectionSort.js
│   │   ├── 4-quickSort.js
│   │   └── 5-mergeSort.js
│   └── STACK ALGORITHM
│       ├── 1-Array.js
│       ├── 2-linkedlist.js
│       ├── 3-reverseString.js
│       └── 4-balancedParanthesis.js
└── WEEK 15
    ├── GRAPH
    │   ├── 1-adjacencyMatrix.js
    │   ├── 2-adjecencyList.js
    │   ├── 3-bfs.js
    │   ├── 4-dfs.js
    │   ├── 5-bfs-shortestPath.js
    │   └── Detect Cycle
    │       ├── 1-undirectedGraph.js
    │       └── 2-directedGraph.js
    ├── HEAP
    │   ├── heapSort.js
    │   ├── maxHeap.js
    │   └── minHeap.js
    ├── TREE
    │   ├── BASIC TREE
    │   │   └── basicTree.js
    │   ├── binaryTree.js
    │   ├── binorySearchTree.js
    │   ├── isBalanced.js
    │   ├── isBST.js
    │   └── isSameTree.js
    └── TRIE
        └── trie.js

---

🚀 Getting Started

1. Clone the repository 🛠️:

   git clone https://github.com/JasimIhsan/Data_Structure.git