docs: 📝 fixed package name typo

README.md

@@ -28,7 +28,7 @@ import {
   RedBlackTree,
   BiDirectionalMap,
   LRUCache,
-} from 'jsr:@msk/data-structures';
+} from 'jsr:@mskr/data-structures';
 ```
 
 ## Available Data Structures and their detailed documentations

docs/bi-map.md

@@ -5,7 +5,7 @@ A bidirectional map (BiMap) implementation that maintains one-to-one mappings be
 ## Usage
 
 ```typescript
-import { BiDirectionalMap } from 'jsr:@msk/data-structures';
+import { BiDirectionalMap } from 'jsr:@mskr/data-structures';
 
 const biMap = new BiDirectionalMap<string, number>();
 ```

docs/binary-heap.md

@@ -5,7 +5,7 @@ A generic binary heap implementation that provides both Min Heap and Max Heap va
 ## Usage
 
 ```typescript
-import { MinHeap, MaxHeap } from 'jsr:@msk/data-structures';
+import { MinHeap, MaxHeap } from 'jsr:@mskr/data-structures';
 
 const minHeap = new MinHeap<number>();
 const maxHeap = new MaxHeap<number>();

docs/deque.md

@@ -5,7 +5,7 @@ A double-ended queue (deque) implementation that efficiently supports insertion
 ## Usage
 
 ```typescript
-import { Deque } from 'jsr:@msk/data-structures';
+import { Deque } from 'jsr:@mskr/data-structures';
 
 const deque = new Deque<number>();
 ```

docs/doubly-linked-list.md

@@ -5,7 +5,7 @@ A doubly linked list implementation that stores elements of type `T` and support
 ## Usage
 
 ```typescript
-import { DoublyLinkedList } from 'jsr:@msk/data-structures';
+import { DoublyLinkedList } from 'jsr:@mskr/data-structures';
 
 const list = new DoublyLinkedList<number>();
 ```

docs/priority-queue.md

@@ -5,7 +5,7 @@ A generic priority queue implementation backed by a binary heap, where elements
 ## Usage
 
 ```typescript
-import { PriorityQueue } from 'jsr:@msk/data-structures';
+import { PriorityQueue } from 'jsr:@mskr/data-structures';
 
 const queue = new PriorityQueue<number>();
 ```

docs/red-black-tree.md

@@ -5,7 +5,7 @@ A generic self-balancing binary search tree implementation that maintains balanc
 ## Usage
 
 ```typescript
-import { RedBlackTree } from 'jsr:@msk/data-structures';
+import { RedBlackTree } from 'jsr:@mskr/data-structures';
 
 const tree = new RedBlackTree<number>();
 ```

docs/sorted-map.md

@@ -5,7 +5,7 @@ A generic key-value collection that maintains entries sorted by key using a Red-
 ## Usage
 
 ```typescript
-import { SortedMap } from 'jsr:@msk/data-structures';
+import { SortedMap } from 'jsr:@mskr/data-structures';
 
 const map = new SortedMap<number, string>();
 ```

docs/trie.md

@@ -5,7 +5,7 @@ A generic trie (prefix tree) implementation that efficiently stores and retrieve
 ## Usage
 
 ```typescript
-import { Trie } from 'jsr:@msk/data-structures';
+import { Trie } from 'jsr:@mskr/data-structures';
 
 const trie = new Trie<number>();
 ```