chore: Update README.md

Author: idsulik

README.md

@@ -13,26 +13,26 @@
 1. [Installation](#installation)
 2. [Usage](#usage)
 3. [Data Structures](#data-structures)
-  - [Set](#set)
-  - [Deque](#deque)
-  - [TimedDeque](#timed-deque)
-  - [LinkedList](#linkedlist)
-  - [Queue](#queue)
-  - [Stack Interface](#stack-interface)
-  - [ArrayStack](#arraystack)
-  - [LinkedListStack](#linkedliststack)
-  - [Trie](#trie)
-  - [Priority Queue](#priority-queue)
-  - [Binary Search Tree](#binary-search-tree)
-  - [Skip List](#skip-list)
-  - [Graph](#graph)
-  - [BloomFilter](#bloom-filter)
-  - [RingBuffer (Circular Buffer)](#ring-buffer)
-  - [SegmentTree](#segment-tree)
-  - [DisjointSet (UnionFind)](#disjoint-set)
-  - [AVL Tree](#avl-tree)
-  - [RedBlack Tree](#redblack-tree)
-  - [Iterator Interface](#iterator-interface)
+    - [Set](#set)
+    - [Deque](#deque)
+    - [TimedDeque](#timed-deque)
+    - [LinkedList](#linkedlist)
+    - [Queue](#queue)
+    - [Stack Interface](#stack-interface)
+    - [ArrayStack](#arraystack)
+    - [LinkedListStack](#linkedliststack)
+    - [Trie](#trie)
+    - [Priority Queue](#priority-queue)
+    - [Binary Search Tree](#binary-search-tree)
+    - [Skip List](#skip-list)
+    - [Graph](#graph)
+    - [BloomFilter](#bloom-filter)
+    - [RingBuffer (Circular Buffer)](#ring-buffer)
+    - [SegmentTree](#segment-tree)
+    - [DisjointSet (UnionFind)](#disjoint-set)
+    - [AVL Tree](#avl-tree)
+    - [RedBlack Tree](#redblack-tree)
+    - [Iterator Interface](#iterator-interface)
 4. [Performance Comparison](#performance-comparison)
 5. [Contributing](#contributing)
 6. [License](#license)