data-structure-typed 2.2.1 → 2.2.2

package/README.md

@@ -9,15 +9,36 @@
 ![NPM](https://img.shields.io/npm/l/data-structure-typed)
 ![npm](https://img.shields.io/npm/v/data-structure-typed)
 
-[//]: # (![npm bundle size](https://img.shields.io/bundlephobia/min/data-structure-typed))
+### 🏠 Uniform API: Coding feels like home.
+> Don't learn new APIs. Just use `push`, `pop`, `map`, `filter`, and `reduce` everywhere.
 
-[//]: # (<p><a href="https://github.com/zrwusa/data-structure-typed/blob/main/README.md">English</a> | <a href="https://github.com/zrwusa/data-structure-typed/blob/main/README_zh-CN.md">简体中文</a></p>)
+### ⚡ High Performance: Speed without compromise.
+> Benchmarks prove it. We outperform native implementations in critical scenarios.
 
+### 🛡️ Type Safe: TypeScript first, always.
+> No more `any`. Enjoy full generics and strict type checking out of the box.
 
-> ***Our goal is to make every data structure as convenient and efficient as JavaScript's Array.***
+### ✨ Zero Friction: It just plays nice.
+> Works with everything. Spread it `[...]`, loop it `for..of`, or convert it instantly.
 
 ## Installation and Usage
 
+### pnpm
+
+```bash
+pnpm add data-structure-typed
+```
+### Playground
+
+[Node.js TypeScript](https://stackblitz.com/edit/stackblitz-starters-e1vdy3zw?file=src%2Findex.ts)
+
+[Node.js JavaScript](https://stackblitz.com/edit/stackblitz-starters-dgvchziu?file=src%2Findex.js)
+
+[React TypeScript](https://stackblitz.com/edit/vitejs-vite-6xvhtdua?file=src%2FApp.tsx)
+
+[NestJS TypeScript](https://stackblitz.com/edit/nestjs-typescript-starter-3cyp7pel?file=src%2Franking%2Franking.service.ts&terminal=start:dev)
+
+
 ### npm
 
 ```bash
@@ -30,7 +51,53 @@ npm i data-structure-typed --save
 yarn add data-structure-typed
 ```
 
-[Playground](https://stackblitz.com/edit/data-structure-typed-playground?file=src%2Fmain.ts)
+### Individual Data Structure Installation
+
+If you only want to use a specific data structure independently:
+
+```bash
+npm i heap-typed --save
+npm i bst-typed --save
+npm i red-black-tree-typed --save
+```
+
+
+---
+
+## 📖 Quick Navigation
+
+Choose your learning path based on your needs:
+
+### 👤 I'm New Here
+
+- ⏱️ **3 Minutes to Productivity**: [Quick Start](#quick-start-3-minutes-to-productivity)
+- 🎓 **Full Understanding**: [Why data-structure-typed?](#why-data-structure-typed)
+- 💻 **Show Me Code**: [Code Snippets](#code-snippets-patterns--examples)
+
+### 🤔 Not Sure Which Data Structure to Use?
+
+- 🎯 **Decision Guide**: [Choose Your Data Structure](#-decision-guide-choose-the-right-data-structure)
+- 📚 **Data Structures Overview**: [Complete List](#-data-structures-available)
+
+### 🔄 Migrating from Native JavaScript?
+
+- 📋 **Migration Guide**: [From Array to Specialized Structures](#-migration-guide-from-native-js)
+- 🚀 **Integration Examples**: [React, Express, Nest.js](#-integration-examples)
+
+### 📊 Performance-Focused?
+
+- ⚡ **Performance Data**: [Benchmark Results](#-performance-comparison)
+- 📈 **Real Cases**: [5 Production Code Examples](#-real-world-examples-production-code)
+
+### 🏢 Enterprise Integration?
+
+- 🔗 **Framework Integration**: [React, Vue, Express, Nest.js, Next.js](#-integration-examples)
+- 🛠️ **Multi-Environment**: [CDN/CommonJS/ESModule/TypeScript](#supported-module-system)
+
+---
+
+
+### Quick Verification
 
 ```js
 import {
@@ -38,227 +105,1166 @@ import {
   AVLTree, SinglyLinkedList, DirectedGraph, RedBlackTree, TreeMultiMap,
   DirectedVertex, Stack, AVLTreeNode
 } from 'data-structure-typed';
+
+// Quick test
+const tree = new RedBlackTree([5, 2, 8, 1, 9]);
+console.log([...tree.keys()]);  // [1, 2, 5, 8, 9]
 ```
 
-If you only want to use a specific data structure independently, you can install it separately, for example, by running
+---
 
-```bash
-npm i heap-typed --save
+## Quick Start: 3 Minutes to Productivity
+
+### Scenario 1: High-Performance Queue
+
+**Problem**: You need to frequently remove elements from the front of a list.
+
+❌ This is slow with Array:
+
+```javascript
+const queue = [1, 2, 3, 4, 5];
+queue.shift();  // O(n) - Reindexes all remaining elements!
+```
+
+✅ This is fast with Deque:
+
+```javascript
+import { Deque } from 'data-structure-typed';
+
+const deque = new Deque([1, 2, 3, 4, 5]);
+deque.shift();  // O(1) - Just moves a pointer
+deque.print();  // [2, 3, 4, 5]
+```
+
+---
+
+### Scenario 2: Sorted Data with Fast Lookups
+
+**Problem**: You need to maintain sorted data and query it efficiently.
+
+❌ Array requires manual sorting:
+
+```javascript
+const arr = [5, 2, 8, 1, 9];
+arr.includes(3);  // O(n) - Must check every element
+```
+
+✅ RedBlackTree maintains sorted order automatically:
+
+```javascript
+import { RedBlackTree } from 'data-structure-typed';
+
+const tree = new RedBlackTree([5, 2, 8, 1, 9]);
+tree.has(3);      // O(log n) - Logarithmic search
+
+// Iterating tree is already sorted
+for (const [key] of tree) {
+  console.log(key);  // 1, 2, 5, 8, 9 (automatically sorted!)
+}
+```
+
+---
+
+### Scenario 3: Priority Queue
+
+**Problem**: Process items by priority, not insertion order.
+
+❌ Array requires re-sorting:
+
+```javascript
+const tasks = [];
+
+function addTask(task) {
+  tasks.push(task);
+  tasks.sort((a, b) => b.priority - a.priority);  // O(n log n) every time!
+}
+```
+
+✅ PriorityQueue maintains priority automatically:
+
+```javascript
+import { MaxPriorityQueue } from 'data-structure-typed';
+
+const pq = new MaxPriorityQueue([], {
+    comparator: (a, b) => b.priority - a.priority,
+});
+
+function addTask(task) {
+    pq.add(task);  // O(log n)
+}
+
+const nextTask = pq.poll(); // Always get highest priority
+```
+
+---
+
+### Scenario 4: Prefix Matching (Autocomplete)
+
+**Problem**: Fast prefix searching in large dictionaries.
+
+```javascript
+import { Trie } from 'data-structure-typed';
+
+const dictionary = new Trie(['apple', 'app', 'apply', 'application']);
+
+const suggestions = dictionary.getWords('appl');
+// Returns: ['apple', 'apply', 'application']
+// Time: O(m + k) where m is prefix length, k is results
+```
+
+---
+
+### Scenario 5: Graph Algorithms
+
+**Problem**: Pathfinding or cycle detection.
+
+```javascript
+import { DirectedGraph } from 'data-structure-typed';
+
+const graph = new DirectedGraph();
+graph.addVertex('A');
+graph.addVertex('B');
+graph.addEdge('A', 'B', 1);
+
+const { minDist, minPath } = graph.dijkstra('A', 'B', true, true);
+```
+
+---
+
+## Why data-structure-typed?
+
+> All data structures in JavaScript should work like native Array.
+> No more API chaos. No more conversions. No more frustration.
+
+### Three Pain Points Every Developer Faces
+
+#### 1️⃣ Performance Wall: When Operations Become Bottlenecks
+
+❌ The Problem: Array.shift() is O(n):
+
+```javascript
+const queue = [1, 2, 3, ..., 100000];
+for (let i = 0; i < 100000; i++) {
+  queue.shift();  // Reindexes all remaining elements!
+}
+// Time: 2829ms for 100K items ❌
+// Impact: Timeout, failed test
+```
+
+✅ The Solution: Use Deque:
+
+```javascript
+import { Deque } from 'data-structure-typed';
+
+const deque = new Deque([1, 2, 3, ..., 100000]);
+for (let i = 0; i < 100000; i++) {
+  deque.shift();  // O(1) - Just moves a pointer
+}
+// Time: 5.83ms for 100K items ✅
+// Speedup: 484x faster! 🚀
+```
+
+**Real-world impact:**
+
+- Competitive programming: TLE ❌ → AC ✅
+- Real-time systems: P99 latency 500ms ❌ → 5ms ✅
+- Message queues: Throughput 100/sec ❌ → 10,000/sec ✅
+
+#### 2️⃣ API Chaos: Learning a New API for Every Data Structure
+
+❌ Different libraries use different APIs:
+
+```javascript
+// Library 1: Uses offer/poll (Java-style)
+queue.offer(item);
+queue.poll();
+
+// Library 2: Uses push/shift
+queue.push(item);
+queue.shift();
+
+// Library 3: Uses enqueue/dequeue
+queue.enqueue(item);
+queue.dequeue();
+```
+
+✅ Our library uses consistent APIs everywhere:
+
+In [java.utils](), you need to memorize different methods for Queue, Deque, LinkedList:
+
+| Java ArrayList | Java Queue | Java ArrayDeque | Java LinkedList |
+|---|---|---|---|
+| add | offer | push | push |
+| remove | poll | removeLast | removeLast |
+| remove | poll | removeFirst | removeFirst |
+| add(0, element) | offerFirst | unshift | unshift |
+
+**In data-structure-typed, you only need to remember four methods**: `push`, `pop`, `shift`, and `unshift` for all linear structures (Queue, Deque, DoublyLinkedList, SinglyLinkedList, Stack).
+
+```javascript
+// ALL linear structures use THE SAME 4 methods
+const deque = new Deque([1, 2, 3]);
+const queue = new Queue([1, 2, 3]);
+const stack = new Stack([1, 2, 3]);
+const list = new DoublyLinkedList([1, 2, 3]);
+
+// They ALL support:
+structure.push(item);           // Add to end
+structure.pop();                // Remove from end
+structure.shift();              // Remove from start
+structure.unshift(item);        // Add to start
+
+// And ALL support Array's advanced methods
+structure.map((_value, key) => key * 2);
+structure.filter((_value, key) => key > 5);
+structure.reduce((acc, _value, key) => acc + key, 0);
+```
+
+#### 3️⃣ Conversion Hell: Bouncing Data Between Structures
+
+❌ The Painful Way:
+
+```javascript
+const scores = [95, 23, 67, 89, 12, 45];
+const tree = new SomeTreeLibrary(scores);
+
+const filtered = tree.toArray().filter(s => s > 50);  // Convert to array
+const mapped = filtered.map(s => s * 2);              // Another conversion
+// Multiple conversions, lost benefits, easy to make mistakes
+```
+
+✅ The Clean Way:
+
+```javascript
+const tree = new RedBlackTree(scores);
+
+// All methods work DIRECTLY on the tree
+const result = tree
+  .filter((_value, key) => key > 50)              // Direct
+  .map((_value, key) => [key, key * 1])           // Direct
+  .reduce((acc, value) => acc + (value ?? 0), 0); // Direct
+
+// ✅ Zero conversions, tree structure maintained
+```
+
+---
+
+## 🔗 Seamless Interoperability: Iterator Protocol Everywhere
+
+### The Hidden Superpower
+
+Every single data structure implements the **Iterator protocol**:
+
+- ✅ Spread operator: `[...tree]`
+- ✅ for...of loops: `for (const item of tree)`
+- ✅ Destructuring: `const [a, b, c] = tree`
+- ✅ Array.from(): `Array.from(tree)`
+- ✅ Set/Map constructors: `new Set(tree)`
+
+### Iterator Support Comparison
+
+| Feature | Array | Map | Set | Other Lib | data-structure-typed |
+|---------|-------|-----|-----|-----------|----------------------|
+| Spread operator | ✅ | ❌/⚠️ | ✅ | ❌/⚠️ | ✅ |
+| for...of loop | ✅ | ✅ | ✅ | ❌/⚠️ | ✅ |
+| Destructuring | ✅ | ❌ | ❌ | ❌ | ✅ |
+| Array.from() | ✅ | ❌/⚠️ | ❌ | ❌/⚠️ | ✅ |
+| Set constructor | ✅ | ❌ | ✅ | ❌ | ✅ |
+| **Full Integration** | ✅ | ⚠️ | ⚠️ | ⚠️ | **✅** |
+
+### Live Examples: Zero Friction Conversions
+
+#### Example 1: Array to Tree to Array
+
+```javascript
+const array = [64, 34, 25, 12, 22, 11, 90];
+const rbTree = new RedBlackTree(array);
+const sorted = [...rbTree.keys()];
+console.log(sorted);  // [11, 12, 22, 25, 34, 64, 90] ✅
+```
+
+#### Example 2: Extract Keys and Values
+
+```javascript
+const rbTree = new RedBlackTree([
+  [1, 'Alice'],
+  [2, 'Bob'],
+  [3, 'Charlie']
+]);
+
+const allKeys = [...rbTree.keys()];      // [1, 2, 3]
+const allValues = [...rbTree.values()];  // ['Alice', 'Bob', 'Charlie']
+```
+
+#### Example 3: for...of on Any Structure
+
+```javascript
+const tree = new RedBlackTree(entries);
+const deque = new Deque(items);
+const heap = new MaxHeap(items);
+
+for (const entry of tree) console.log(entry);
+for (const item of deque) console.log(item);
+for (const item of heap) console.log(item);
 ```
 
-## Why
+---
 
-Do you envy C++ with [STL]() (std::), Python with [collections](), and Java with [java.util]() ? Well, no need to envy
-anymore! JavaScript and TypeScript now have [data-structure-typed]().**`Benchmark`** compared with C++ STL.
-**`API standards`** aligned with ES6 and Java. **`Usability`** is comparable to Python
+## 🎁 All Array Methods Work Everywhere
 
+### The Biggest Developer Joy: Array Methods, Everywhere
 
-[//]: # (![Branches]&#40;https://img.shields.io/badge/branches-55.47%25-red.svg?style=flat&#41;)
+You know these methods. You use them every day. They work on **every data structure**:
 
-[//]: # (![Statements]&#40;https://img.shields.io/badge/statements-67%25-red.svg?style=flat&#41;)
+#### Chain on Tree
 
-[//]: # (![Functions]&#40;https://img.shields.io/badge/functions-66.38%25-red.svg?style=flat&#41;)
+```typescript
+const rbTree = new RedBlackTree([
+  [1, { name: 'Alice', age: 25 }],
+  [2, { name: 'Bob', age: 30 }],
+  [3, { name: 'Charlie', age: 28 }],
+]);
 
-[//]: # (![Lines]&#40;https://img.shields.io/badge/lines-68.6%25-red.svg?style=flat&#41;)
+const result = rbTree
+  .filter((value, _key) => (value?.age ?? 0) > 26)
+  .map((value, key) => [key, { ...value, id: key }])
+  .reduce((sum, value) => sum + (value?.age ?? 0), 0);
+
+console.log(result); // 58 ✅
+```
+
+#### Chain on Heap
+
+```typescript
+const minHeap = new Heap([
+  { priority: 5, task: 'Email' },
+  { priority: 3, task: 'Chat' },
+  { priority: 8, task: 'Alert' },
+], { comparator: (a, b) => a.priority - b.priority });
+
+const urgent = minHeap
+  .filter((value, _key) => value.priority > 4)
+  .map((value, _key) => value.task);
+
+urgent.print(); // ['Alert', 'Email'] ✅
+```
 
-### Performance
+#### Chain on Deque
+
+```typescript
+const deque = new Deque([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
+
+const stats = {
+  even: deque.filter((value, _key) => value % 2 === 0).toArray(),
+  squared: deque.map((value, _key) => value * value).toArray(),
+  hasLarge: deque.some((value, _key) => value > 8),
+  sum: deque.reduce((acc, value, _key) => acc + value, 0),
+};
+```
+
+### Supported Methods Across All Structures
+
+| Method | Tree | Heap | Deque | Graph | LinkedList |
+|--------|------|------|-------|-------|------------|
+| map | ✅ | ✅ | ✅ | ✅ | ✅ |
+| filter | ✅ | ✅ | ✅ | ✅ | ✅ |
+| reduce | ✅ | ✅ | ✅ | ✅ | ✅ |
+| find | ✅ | ✅ | ✅ | ✅ | ✅ |
+| some/every | ✅ | ✅ | ✅ | ✅ | ✅ |
+| keys/values | ✅ | ✅ | ✅ | ✅ | ✅ |
+| forEach | ✅ | ✅ | ✅ | ✅ | ✅ |
+
+---
+
+## Why Not Just Use Native JavaScript?
+
+### Case 1: Map Doesn't Maintain Sorted Order
+
+❌ Map iteration is insertion order, not key order:
+
+```javascript
+const map = new Map([[5, 'E'], [2, 'B'], [8, 'H'], [1, 'A']]);
+for (const [key, value] of map) {
+  console.log(key);  // 5, 2, 8, 1 (insertion order)
+}
+```
+
+✅ RedBlackTree maintains sorted order automatically:
+
+```javascript
+const tree = new RedBlackTree([[5, 'E'], [2, 'B'], [8, 'H'], [1, 'A']]);
+for (const [key, value] of tree) {
+  console.log(key);  // 1, 2, 5, 8 (key order) ✅
+}
+```
+
+### Case 2: Array.shift is Too Slow
+
+❌ Array.shift is O(n):
+
+```javascript
+const queue = [];
+for (let i = 0; i < 100000; i++) queue.push(i);
+for (let i = 0; i < 100000; i++) queue.shift();
+// Time: 2829ms ❌
+```
+
+✅ Deque.shift is O(1):
+
+```javascript
+const deque = new Deque();
+for (let i = 0; i < 100000; i++) deque.push(i);
+for (let i = 0; i < 100000; i++) deque.shift();
+// Time: 5.83ms ✅
+```
+
+### Case 3: Maintaining Priority is Manual
+
+❌ Array requires re-sorting O(n log n):
+
+```javascript
+const tasks = [];
+function addTask(task) {
+  tasks.push(task);
+  tasks.sort((a, b) => b.priority - a.priority);
+}
+```
+
+✅ PriorityQueue maintains priority O(log n):
+
+```javascript
+const pq = new MaxPriorityQueue();
+function addTask(task) {
+  pq.add(task);  // O(log n)
+}
+```
+
+### Case 4: Range Queries are Tedious
+
+❌ Array.filter is O(n):
+
+```javascript
+const prices = [10, 45, 23, 67, 89, 12, 54, 33, 78];
+const inRange = prices.filter(p => p >= 30 && p <= 70);
+```
+
+✅ RedBlackTree range queries are O(log n + k):
+
+```javascript
+const tree = new RedBlackTree(prices.map((p, i) => [p, i]));
+const inRange = tree.filter((_value, p) => p >= 30 && p <= 70);
+```
+
+### Case 5: Prefix Matching is Tedious
+
+❌ Array.filter is O(n*m):
+
+```javascript
+const words = ['apple', 'app', 'apply', 'application'];
+const matches = words.filter(w => w.startsWith('app'));
+// For 1M words: checks 1M words ❌
+```
+
+✅ Trie prefix matching is O(m + k):
+
+```javascript
+const trie = new Trie(words);
+const matches = trie.getWords('appl');
+// O(5 + 4) = 9 operations ✅
+```
+
+---
+
+## 📊 Performance Comparison
 
 Performance surpasses that of native JS/TS
 
-<table style="display: table; width:100%; table-layout: fixed;">
-  <thead>
-  <tr>
-    <th>Method</th>
-    <th>Time Taken</th>
-    <th>Data Scale</th>
-    <th>Belongs To</th>
-    <th>big O</th>
-  </tr>
-  </thead>
-  <tbody>
-  <tr>
-    <td>Queue.push &amp; shift</td>
-    <td>5.83 ms</td>
-    <td>100K</td>
-    <td>Ours</td>
-    <td>O(1)</td>
-  </tr>
-  <tr>
-    <td>Array.push &amp; shift</td>
-    <td>2829.59 ms</td>
-    <td>100K</td>
-    <td>Native JS</td>
-    <td>O(n)</td>
-  </tr>
-  <tr>
-    <td>Deque.unshift &amp; shift</td>
-    <td>2.44 ms</td>
-    <td>100K</td>
-    <td>Ours</td>
-    <td>O(1)</td>
-  </tr>
-  <tr>
-    <td>Array.unshift &amp; shift</td>
-    <td>4750.37 ms</td>
-    <td>100K</td>
-    <td>Native JS</td>
-    <td>O(n)</td>
-  </tr>
-  <tr>
-    <td>HashMap.set</td>
-    <td>122.51 ms</td>
-    <td>1M</td>
-    <td>Ours</td>
-    <td>O(1)</td>
-  </tr>
-  <tr>
-    <td>Map.set</td>
-    <td>223.80 ms</td>
-    <td>1M</td>
-    <td>Native JS</td>
-    <td>O(1)</td>
-  </tr>
-  <tr>
-    <td>Set.add</td>
-    <td>185.06 ms</td>
-    <td>1M</td>
-    <td>Native JS</td>
-    <td>O(1)</td>
-  </tr>
-  </tbody>
-</table>
+| Method | Time Taken | Data Scale | Belongs To | Big O |
+|--------|-----------|-----------|-----------|-------|
+| Queue.push & shift | 5.83 ms | 100K | Ours | O(1) |
+| Array.push & shift | 2829.59 ms | 100K | Native JS | O(n) |
+| Deque.unshift & shift | 2.44 ms | 100K | Ours | O(1) |
+| Array.unshift & shift | 4750.37 ms | 100K | Native JS | O(n) |
+| HashMap.set | 122.51 ms | 1M | Ours | O(1) |
+| Map.set | 223.80 ms | 1M | Native JS | O(1) |
+| Set.add | 185.06 ms | 1M | Native JS | O(1) |
 
-### Plain language explanations
+### Benchmark
 
-<table>
-  <tr>
-    <th>Data Structure</th>
-    <th>Plain Language Definition</th>
-    <th>Diagram</th>
-  </tr>
-  <tr>
-    <td>Linked List (Singly Linked List)</td>
-    <td>A line of bunnies, where each bunny holds the tail of the bunny in front of it (each bunny only knows the name of the bunny behind it). You want to find a bunny named Pablo, and you have to start searching from the first bunny. If it's not Pablo, you continue following that bunny's tail to the next one. So, you might need to search n times to find Pablo (O(n) time complexity). If you want to insert a bunny named Remi between Pablo and Vicky, it's very simple. You just need to let Vicky release Pablo's tail, let Remi hold Pablo's tail, and then let Vicky hold Remi's tail (O(1) time complexity).</td>
-    <td><img alt="singly linked list" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/singly-linked-list.png"></td>  
-  </tr>
-  <tr>
-    <td>Array</td>
-    <td>A line of numbered bunnies. If you want to find the bunny named Pablo, you can directly shout out Pablo's number 0680 (finding the element directly through array indexing, O(1) time complexity). However, if you don't know Pablo's number, you still need to search one by one (O(n) time complexity). Moreover, if you want to add a bunny named Vicky behind Pablo, you will need to renumber all the bunnies after Vicky (O(n) time complexity).</td>
-    <td><img alt="array" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/array.png"></td>  
-  </tr>
-  <tr>
-    <td>Queue</td>
-    <td>A line of numbered bunnies with a sticky note on the first bunny. For this line with a sticky note on the first bunny, whenever we want to remove a bunny from the front of the line, we only need to move the sticky note to the face of the next bunny without actually removing the bunny to avoid renumbering all the bunnies behind (removing from the front is also O(1) time complexity). For the tail of the line, we don't need to worry because each new bunny added to the tail is directly given a new number (O(1) time complexity) without needing to renumber all the previous bunnies.</td>
-    <td><img alt="queue" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/queue.jpg"></td>  
-  </tr>
-  <tr>
-    <td>Deque</td>
-    <td>A line of grouped, numbered bunnies with a sticky note on the first bunny. For this line, we manage it by groups. Each time we remove a bunny from the front of the line, we only move the sticky note to the next bunny. This way, we don't need to renumber all the bunnies behind the first bunny each time a bunny is removed. Only when all members of a group are removed do we reassign numbers and regroup. The tail is handled similarly. This is a strategy of delaying and batching operations to offset the drawbacks of the Array data structure that requires moving all elements behind when inserting or deleting elements in the middle.</td>
-    <td><img alt="deque" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/deque.png"></td>  
-  </tr>
-  <tr>
-    <td>Doubly Linked List</td>
-    <td>A line of bunnies where each bunny holds the tail of the bunny in front (each bunny knows the names of the two adjacent bunnies). This provides the Singly Linked List the ability to search forward, and that's all. For example, if you directly come to the bunny Remi in the line and ask her where Vicky is, she will say the one holding my tail behind me, and if you ask her where Pablo is, she will say right in front.</td>
-    <td><img alt="doubly linked list" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/doubly-linked-list.png"></td>  
-  </tr>
-  <tr>
-    <td>Stack</td>
-    <td>A line of bunnies in a dead-end tunnel, where bunnies can only be removed from the tunnel entrance (end), and new bunnies can only be added at the entrance (end) as well.</td>
-    <td><img alt="stack" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/stack.jpg"></td>  
-  </tr>
-  <tr>
-    <td>Binary Tree</td>
-    <td>As the name suggests, it's a tree where each node has at most two children. When you add consecutive data such as [4, 2, 6, 1, 3, 5, 7], it will be a complete binary tree. When you add data like [4, 2, 6, null, 1, 3, null, 5, null, 7], you can specify whether any left or right child node is null, and the shape of the tree is fully controllable.</td>
-    <td><img alt="binary tree" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/binary-tree.png"></td>  
-  </tr>
-  <tr>
-    <td>Binary Search Tree (BST)</td>
-    <td>A tree-like rabbit colony composed of doubly linked lists where each rabbit has at most two tails. These rabbits are disciplined and obedient, arranged in their positions according to a certain order. The most important data structure in a binary tree (the core is that the time complexity for insertion, deletion, modification, and search is O(log n)). The data stored in a BST is structured and ordered, not in strict order like 1, 2, 3, 4, 5, but maintaining that all nodes in the left subtree are less than the node, and all nodes in the right subtree are greater than the node. This order provides O(log n) time complexity for insertion, deletion, modification, and search. Reducing O(n) to O(log n) is the most common algorithm complexity optimization in the computer field, an exponential improvement in efficiency. It's also the most efficient way to organize unordered data into ordered data (most sorting algorithms only maintain O(n log n)). Of course, the binary search trees we provide support organizing data in both ascending and descending order. Remember that basic BSTs do not have self-balancing capabilities, and if you sequentially add sorted data to this data structure, it will degrade into a list, thus losing the O(log n) capability. Of course, our addMany method is specially handled to prevent degradation. However, for practical applications, please use Red-black Tree or AVL Tree as much as possible, as they inherently have self-balancing functions.</td>
-    <td><img alt="binary search tree" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/binary-search-tree.png"></td>  
-  </tr>
-  <tr>
-    <td>Red-black Tree</td>
-    <td>A tree-like rabbit colony composed of doubly linked lists, where each rabbit has at most two tails. These rabbits are not only obedient but also intelligent, automatically arranging their positions in a certain order. A self-balancing binary search tree. Each node is marked with a red-black label. Ensuring that no path is more than twice as long as any other (maintaining a certain balance to improve the speed of search, addition, and deletion).</td>
-    <td><img alt="red-black tree" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/red-black tree.png"></td>  
-  </tr>
-  <tr>
-    <td>AVL Tree</td>
-    <td>A tree-like rabbit colony composed of doubly linked lists, where each rabbit has at most two tails. These rabbits are not only obedient but also intelligent, automatically arranging their positions in a certain order, and they follow very strict rules. A self-balancing binary search tree. Each node is marked with a balance factor, representing the height difference between its left and right subtrees. The absolute value of the balance factor does not exceed 1 (maintaining stricter balance, which makes search efficiency higher than Red-black Tree, but insertion and deletion operations will be more complex and relatively less efficient).</td>
-    <td><img alt="avl tree" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/avl-tree.png"></td>  
-  </tr>
-  <tr>
-    <td>Heap</td>
-    <td>A special type of complete binary tree, often stored in an array, where the children nodes of the node at index i are at indices 2i+1 and 2i+2. Naturally, the parent node of any node is at ⌊(i−1)/2⌋.</td>
-    <td><img alt="heap" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/heap.jpg"></td>  
-  </tr>
-  <tr>
-    <td>Priority Queue</td>
-    <td>It's actually a Heap.</td>
-    <td><img alt="priority queue" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/heap.jpg"></td>  
-  </tr>
-  <tr>
-    <td>Graph</td>
-    <td>The base class for Directed Graph and Undirected Graph, providing some common methods.</td>
-    <td><img alt="graph" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/graph.png"></td>  
-  </tr>
-  <tr>
-    <td>Directed Graph</td>
-    <td>A network-like bunny group where each bunny can have up to n tails (Singly Linked List).</td>
-    <td><img alt="directed graph" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/directed-graph.png"></td>  
-  </tr>
-  <tr>
-    <td>Undirected Graph</td>
-    <td>A network-like bunny group where each bunny can have up to n tails (Doubly Linked List).</td>
-    <td><img alt="undirected graph" src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/undirected-graph.png"></td>  
-  </tr>
-</table>
+MacBook Pro (15-inch, 2018)
+
+Processor 2.2 GHz 6-Core Intel Core i7
+
+Memory 16 GB 2400 MHz DDR4
+
+Graphics Radeon Pro 555X 4 GB
+
+Intel UHD Graphics 630 1536 MB
+
+macOS Sequoia 15.7.2
+
+### Performance & Runtime Compatibility
+
+[//]: # (No deletion!!! Start of Replace Section)
+
+<h2>red-black-tree</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>1,000,000 add</td><td>410.34</td><td>0.41</td><td>0.01</td></tr><tr><td>1,000,000 get</td><td>5.20</td><td>0.01</td><td>8.16e-5</td></tr><tr><td>1,000,000 iterator</td><td>154.25</td><td>0.15</td><td>0.02</td></tr><tr><td>CPT 1,000,000 add</td><td>656.43</td><td>0.66</td><td>0.00</td></tr><tr><td>CPT 1,000,000 add</td><td>684.17</td><td>0.68</td><td>0.01</td></tr></tbody></table><h2>queue</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>1,000,000 push</td><td>26.97</td><td>0.03</td><td>0.00</td></tr><tr><td>100,000 push & shift</td><td>2.87</td><td>0.00</td><td>2.71e-4</td></tr><tr><td>Native JS Array 100,000 push & shift</td><td>1120.94</td><td>1.12</td><td>0.20</td></tr></tbody></table><h2>deque</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>1,000,000 push</td><td>8.75</td><td>0.01</td><td>6.99e-4</td></tr><tr><td>1,000,000 push & pop</td><td>12.95</td><td>0.01</td><td>4.21e-4</td></tr><tr><td>1,000,000 push & shift</td><td>13.73</td><td>0.01</td><td>4.53e-4</td></tr><tr><td>100,000 push & shift</td><td>1.36</td><td>0.00</td><td>5.42e-5</td></tr><tr><td>Native JS Array 100,000 push & shift</td><td>1167.06</td><td>1.17</td><td>0.26</td></tr><tr><td>100,000 unshift & shift</td><td>1.31</td><td>0.00</td><td>4.73e-5</td></tr><tr><td>Native JS Array 100,000 unshift & shift</td><td>1911.47</td><td>1.91</td><td>0.02</td></tr></tbody></table><h2>heap</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>100,000 add</td><td>4.60</td><td>0.00</td><td>1.07e-4</td></tr><tr><td>100,000 add & poll</td><td>16.96</td><td>0.02</td><td>3.45e-4</td></tr></tbody></table><h2>avl-tree</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>100,000 add randomly</td><td>324.51</td><td>0.32</td><td>0.01</td></tr><tr><td>100,000 add</td><td>299.76</td><td>0.30</td><td>0.02</td></tr><tr><td>100,000 get</td><td>0.26</td><td>2.58e-4</td><td>3.65e-6</td></tr><tr><td>100,000 getNode</td><td>169.33</td><td>0.17</td><td>0.00</td></tr><tr><td>100,000 iterator</td><td>14.43</td><td>0.01</td><td>0.00</td></tr><tr><td>100,000 add & delete orderly</td><td>434.44</td><td>0.43</td><td>0.01</td></tr><tr><td>100,000 add & delete randomly</td><td>541.78</td><td>0.54</td><td>0.01</td></tr></tbody></table><h2>hash-map</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>1,000,000 set</td><td>43.23</td><td>0.04</td><td>0.01</td></tr><tr><td>Native JS Map 1,000,000 set</td><td>147.12</td><td>0.15</td><td>0.01</td></tr><tr><td>Native JS Set 1,000,000 add</td><td>116.18</td><td>0.12</td><td>0.01</td></tr><tr><td>1,000,000 set & get</td><td>46.39</td><td>0.05</td><td>0.01</td></tr><tr><td>Native JS Map 1,000,000 set & get</td><td>196.92</td><td>0.20</td><td>0.01</td></tr><tr><td>Native JS Set 1,000,000 add & has</td><td>163.92</td><td>0.16</td><td>0.01</td></tr><tr><td>1,000,000 ObjKey set & get</td><td>243.36</td><td>0.24</td><td>0.03</td></tr><tr><td>Native JS Map 1,000,000 ObjKey set & get</td><td>211.66</td><td>0.21</td><td>0.02</td></tr><tr><td>Native JS Set 1,000,000 ObjKey add & has</td><td>196.57</td><td>0.20</td><td>0.01</td></tr></tbody></table><h2>directed-graph</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>1,000 addVertex</td><td>0.05</td><td>4.60e-5</td><td>6.59e-7</td></tr><tr><td>1,000 addEdge</td><td>3.02</td><td>0.00</td><td>2.85e-4</td></tr><tr><td>1,000 getVertex</td><td>0.04</td><td>3.77e-5</td><td>4.66e-7</td></tr><tr><td>1,000 getEdge</td><td>41.48</td><td>0.04</td><td>0.01</td></tr><tr><td>tarjan</td><td>240.33</td><td>0.24</td><td>0.01</td></tr><tr><td>topologicalSort</td><td>195.62</td><td>0.20</td><td>0.01</td></tr></tbody></table><h2>trie</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>100,000 push</td><td>27.15</td><td>0.03</td><td>6.61e-4</td></tr><tr><td>100,000 getWords</td><td>41.18</td><td>0.04</td><td>0.00</td></tr></tbody></table><h2>stack</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>1,000,000 push</td><td>25.21</td><td>0.03</td><td>0.00</td></tr><tr><td>1,000,000 push & pop</td><td>29.12</td><td>0.03</td><td>0.00</td></tr></tbody></table>
+
+[//]: # (No deletion!!! End of Replace Section)
+
+---
+
+## 🌍 Plain Language Explanations
+
+For those who love understanding concepts through metaphors:
+
+| Data Structure | Plain Language Definition | Example |
+|---|---|---|
+| **Linked List** | A line of bunnies, where each bunny holds the tail of the bunny in front (each bunny only knows the bunny behind). Search takes O(n) time but insertion is O(1). | To find bunny "Pablo", start from the first bunny and follow tails until found |
+| **Array** | A line of numbered bunnies. You can find bunny #680 directly (O(1)), but inserting a bunny requires renumbering all bunnies behind it (O(n)). | Finding element by index is instant, but inserting in the middle is slow |
+| **Queue** | A line of numbered bunnies with a sticky note on the first bunny. Removing from front only moves the sticky note (O(1)), without renumbering. Adding to the tail gives new numbers (O(1)). | Process items in FIFO order, efficiently from both ends |
+| **Deque** | A line of grouped, numbered bunnies with a sticky note. Remove from front by moving sticky note (O(1)). When a group is exhausted, renumber only that group. Tail handled similarly. | Efficient removal/insertion from both ends with batching optimization |
+| **Stack** | A line of bunnies in a dead-end tunnel. Add/remove only at the entrance/end. | Process items in LIFO order |
+| **Binary Tree** | A tree where each node (bunny) has at most two children. When you add sorted data like [4,2,6,1,3,5,7], it forms a complete binary tree. | Hierarchical organization of data |
+| **Binary Search Tree** | Disciplined bunnies arranged by order: all left subtree values < node < all right subtree values. This maintains O(log n) for search/insert/delete. | Find items exponentially faster than linear search |
+| **Red-Black Tree** | A self-balancing binary search tree where nodes are marked red/black to ensure no path is twice as long as another. | Maintains O(log n) guarantees automatically |
+| **AVL Tree** | A strictly balanced binary search tree where every node's left/right subtrees differ by at most 1 in height. Provides highest search efficiency but slower insertions/deletions. | Maximum search speed with strict balance |
+| **Heap** | A special complete binary tree stored in an array. Parent at index i has children at 2i+1 and 2i+2. | Efficient priority queue implementation |
+| **Trie** | A tree where each node represents a character. Path from root to node spells a word. | Prefix search in O(m + k) time instead of O(n*m) |
+| **Graph** | A network of connected bunnies. Directed: each bunny points to specific other bunnies. Undirected: mutual connections. | Model relationships, networks, dependencies |
+
+
+---
+
+## 💻 Code Snippets: Patterns & Examples
+
+### Pattern 1: Interoperability & Iterator Conversion
+
+```typescript
+import { RedBlackTree } from 'data-structure-typed';
+
+const numbers = [6, 1, 2, 7, 5, 3, 4, 9, 8];
+
+// Create sorted tree
+const tree = new RedBlackTree(numbers);
+
+// Convert to array (spread operator)
+const sorted = [...tree];
+console.log(sorted);  // [1, 2, 3, 4, 5, 6, 7, 8, 9]
+
+// Iterate with for...of
+for (const item of tree) {
+  console.log(item);
+}
+
+// Get keys/values separately
+const keys = [...tree.keys()];
+const values = [...tree.values()];
+
+// Destructuring works
+const [first, second, ...rest] = tree;
+
+// Works with native JavaScript
+const json = JSON.stringify([...tree]);
+const set = new Set(tree.keys());
+```
+
+### Pattern 2: Method Chaining on Exotic Structures
+
+❌ Before (Array with shift):
+
+```javascript
+const queue = [1, 2, 3, 4, 5];
+for (let i = 0; i < 100000; i++) {
+  queue.shift();  // O(n)
+}
+```
+
+✅ After (Deque):
+
+```javascript
+import { Deque } from 'data-structure-typed';
+
+const deque = new Deque([1, 2, 3, 4, 5]);
+for (let i = 0; i < 100000; i++) {
+  deque.shift();  // O(1)
+}
+```
+
+### Pattern 3: Seamless Structure Conversion
+
+```typescript
+import { RedBlackTree, MaxHeap, Deque } from 'data-structure-typed';
+
+const data = [64, 34, 25, 12, 22, 11, 90];
+
+// Array → Tree for sorting
+const tree = new RedBlackTree(data);
+console.log([...tree.keys()]);  // [11, 12, 22, 25, 34, 64, 90]
+
+// Tree → Heap for priority
+const heap = new MaxHeap([...tree.keys()]);
+
+// Heap → Deque for queue operations
+const deque = new Deque([...heap]);
+
+// Back to Array for final output
+const result = [...deque];
+```
+
+### Pattern 4: Query and Analysis
+
+#### Tree Example
+
+```typescript
+const tree = new RedBlackTree<number, { name: string; score: number }>();
+tree.add(1, { name: 'Alice', score: 95 });
+tree.add(2, { name: 'Bob', score: 87 });
+tree.add(3, { name: 'Charlie', score: 92 });
+
+const totalHighScore = tree
+  .filter((value, _key) => (value?.score ?? 0) >= 85)
+  .map((value, key) => [key, value?.score ?? 0])
+  .reduce((sum, score) => sum + (score ?? 0), 0);
+
+console.log(totalHighScore);  // 274
+```
+
+#### Heap Example
+
+```typescript
+const heap = new MaxHeap([
+  { priority: 5, task: 'Email' },
+  { priority: 8, task: 'Alert' },
+], { comparator: (a, b) => b.priority - a.priority });
+
+const urgentTasks = heap
+  .filter((value, _key) => value.priority >= 8)
+  .map((value, _key) => [value.priority, value.task]);
+```
+
+#### Deque Example
+
+```typescript
+const deque = new Deque<number>([1, 2, 3, 4, 5]);
+
+const evenSum = deque
+  .filter((value, _key) => value % 2 === 0)
+  .map((value, _key) => value * 2)
+  .reduce((sum, value) => sum + value, 0);
+```
+
+---
+
+## 📚 CRUD Operations: Basic Usage Examples
+
+### Red Black Tree CRUD
+
+#### TS
+
+```ts
+import { RedBlackTree } from 'data-structure-typed';
+
+const rbTree = new RedBlackTree<number>();
+
+// CREATE: Add elements
+rbTree.add(11);
+rbTree.add(3);
+rbTree.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
+
+// READ: Query elements
+rbTree.has(6);                     // true
+rbTree.size === 16;                // true
+const node6 = rbTree.getNode(6);   // BSTNode
+rbTree.getHeight(6) === 2;         // true (height of node with key 6)
+rbTree.getHeight() === 5;          // true (tree height)
+
+// UPDATE: Delete elements
+rbTree.delete(6);
+rbTree.get(6);                     // undefined
+
+// Query after update
+rbTree.getLeftMost()?.key === 1;   // true
+rbTree.isAVLBalanced();            // true
+
+rbTree.print()
+//       ______________11_____           
+//      /                     \          
+//   ___3_______            _13_____
+//  /           \          /        \    
+//  1_     _____8____     12      _15__
+//    \   /          \           /     \ 
+//    2   4_       _10          14    16
+//          \     /                      
+//          5_    9
+//            \                          
+//            7
+```
+
+#### JS
+
+```js
+import { RedBlackTree } from 'data-structure-typed';
+
+const rbTree = new RedBlackTree();
+
+// CREATE
+rbTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
+
+// READ
+rbTree.has(6);                 // true
+const height = rbTree.getHeight();  // 5
+
+// UPDATE
+rbTree.delete(10);
+rbTree.isAVLBalanced();        // true
+
+// PRINT
+rbTree.print();
+```
+
+### BST CRUD with Custom Objects
+
+```ts
+import { BST, BSTNode } from 'data-structure-typed';
+
+const bst = new BST<number, { height: number, age: number }>();
+
+// CREATE
+bst.add(11, { "name": "Pablo", "size": 15 });
+bst.add(3, { "name": "Kirk", "size": 1 });
+
+bst.addMany(
+  [15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5],
+  [
+    { "name": "Alice", "size": 15 },
+    { "name": "Bob", "size": 1 },
+    { "name": "Charlie", "size": 8 },
+    { "name": "David", "size": 13 },
+    { "name": "Emma", "size": 16 },
+    { "name": "Frank", "size": 2 },
+    { "name": "Grace", "size": 6 },
+    { "name": "Hannah", "size": 9 },
+    { "name": "Isaac", "size": 12 },
+    { "name": "Jack", "size": 14 },
+    { "name": "Katie", "size": 4 },
+    { "name": "Liam", "size": 7 },
+    { "name": "Mia", "size": 10 },
+    { "name": "Noah", "size": 5 }
+  ]
+);
+
+// READ
+const value = bst.get(11);     // { "name": "Pablo", "size": 15 }
+const has11 = bst.has(11);     // true
+
+// UPDATE
+bst.delete(11);
+
+// VERIFY
+const afterDelete = bst.has(11);  // false
+```
+
+### Queue/Deque CRUD
+
+```ts
+import { Queue, Deque } from 'data-structure-typed';
+
+const queue = new Queue([1, 2, 3, 4, 5]);
+
+// CREATE/ADD
+queue.push(6);                 // O(1)
+
+// READ
+const front = queue.peek();    // 1
+const size = queue.size;       // 6
+
+// REMOVE
+const removed = queue.shift(); // O(1) - removes 1
+queue.pop();                   // O(1) - removes last
+
+// Same API for Deque
+const deque = new Deque([1, 2, 3, 4, 5]);
+deque.push(6);
+deque.unshift(0);              // Add to front
+deque.pop();                   // Remove from end
+deque.shift();                 // Remove from front
+```
+
+### Graph CRUD
+
+```ts
+import { DirectedGraph } from 'data-structure-typed';
+
+const graph = new DirectedGraph<string>();
+
+// CREATE
+graph.addVertex('A');
+graph.addVertex('B');
+graph.addVertex('C');
+
+// CONNECT
+graph.addEdge('A', 'B');
+graph.addEdge('B', 'C');
+graph.addEdge('A', 'C');
+
+// READ
+graph.hasVertex('A');          // true
+graph.hasEdge('A', 'B');       // true
+const neighbors = graph.getNeighbors('A');  // ['B', 'C']
+
+// UPDATE
+graph.deleteEdgeSrcToDest('A', 'C');
+graph.hasEdge('A', 'C');       // false
+
+// ALGORITHMS
+const topologicalOrder = graph.topologicalSort();
+const { minDist, minPath } = graph.dijkstra('A', 'C');
+```
+
+---
+
+## 📚 Real-World Examples: Production Code
+
+### Example 1: Message Queue - Order Processing
+
+```typescript
+import { Deque } from 'data-structure-typed';
+
+interface Order {
+  id: string;
+  customerId: string;
+  priority: 'normal' | 'urgent';
+}
+
+class OrderProcessor {
+  private normalQueue = new Deque<Order>();
+  private urgentQueue = new Deque<Order>();
+  private running = false;
+  
+  constructor(private readonly urgentBurst: number = 5) {}
+
+  addOrder(order: Order): void {
+    if (order.priority === 'urgent') {
+      this.urgentQueue.push(order);
+    } else {
+      this.normalQueue.push(order);
+    }
+    void this.processOrders();
+  }
+
+  async processOrders(): Promise<void> {
+    if (this.running) return;
+    this.running = true;
+
+    try {
+      let urgentStreak = 0;
+
+      while (!this.urgentQueue.isEmpty() || !this.normalQueue.isEmpty()) {
+        const shouldTakeUrgent = 
+          !this.urgentQueue.isEmpty() &&
+          (urgentStreak < this.urgentBurst || this.normalQueue.isEmpty());
+
+        const order = shouldTakeUrgent ? this.urgentQueue.shift() : this.normalQueue.shift();
+        if (!order) continue;
+
+        urgentStreak = order.priority === 'urgent' ? urgentStreak + 1 : 0;
+
+        try {
+          await this.processOrder(order);
+        } catch (err) {
+          console.error(`FAILED`, order.id, err);
+        }
+      }
+    } finally {
+      this.running = false;
+    }
+  }
+
+  private async processOrder(order: Order): Promise<void> {
+    await new Promise<void>(r => setTimeout(r, 10));
+    console.log(
+      `OK [${order.priority.toUpperCase()}] order:${order.id} customer:${order.customerId}`
+    );
+  }
+}
+```
+
+### Example 2: LRU Cache
+
+```typescript
+class LRUCache<T> {
+  private cache = new DoublyLinkedList<[string, T]>();
+  private map = new Map<string, any>();
+  private maxSize = 100;
+
+  get(key: string): T | null {
+    const node = this.map.get(key);
+    if (!node) return null;
+
+    this.cache.delete(node);
+    const newNode = this.cache.push(key, node.value[1]);
+    this.map.set(key, newNode);
+    return node.value[1];
+  }
+
+  set(key: string, value: T): void {
+    if (this.map.has(key)) {
+      const node = this.map.get(key)!;
+      this.cache.delete(node);
+    }
+
+    const node = this.cache.push(key, value);
+    this.map.set(key, node);
+
+    if (this.cache.length > this.maxSize) {
+      const oldest = this.cache.shift();
+      if (oldest) {
+        this.map.delete(oldest[0]);
+      }
+    }
+  }
+}
+
+// Why DoublyLinkedList?
+// - O(1) delete from any position
+// - O(1) push to end
+// - Perfect for LRU implementation
+```
+
+### Example 3: Leaderboard System
+
+```typescript
+import { RedBlackTree } from 'data-structure-typed';
+
+interface Player {
+  id: string;
+  name: string;
+  score: number;
+}
+
+class Leaderboard {
+  private scoreTree = new RedBlackTree<number, Player>();
+  private playerMap = new Map<string, number>();
+
+  updateScore(playerId: string, newScore: number): void {
+    if (this.playerMap.has(playerId)) {
+      const oldScore = this.playerMap.get(playerId)!;
+      this.scoreTree.delete(oldScore);
+    }
+
+    const player: Player = { id: playerId, name: playerId, score: newScore };
+    this.scoreTree.add(newScore, player);
+    this.playerMap.set(playerId, newScore);
+  }
+
+  getTopN(n: number): Player[] {
+    return [...this.scoreTree.values()].reverse().slice(0, n) as Player[];
+  }
+
+  getRank(playerId: string): number | null {
+    const score = this.playerMap.get(playerId);
+    if (score === undefined) return null;
+
+    const higherScores = [...this.scoreTree.keys()].filter(s => s > score).length;
+    return higherScores + 1;
+  }
+}
+
+// Why RedBlackTree?
+// - Automatically maintains sorted order
+// - O(log n) insertions and deletions
+// - O(log n) searches
+// - Perfect for real-time rankings
+```
+
+### Example 4: Task Scheduler with Priority Queue
+
+```typescript
+import { MaxPriorityQueue } from 'data-structure-typed';
+
+interface Task {
+  id: string;
+  priority: number;
+  action: () => Promise<void>;
+}
+
+class TaskScheduler {
+  private maxPQ = new MaxPriorityQueue<Task>([], {
+    comparator: (a, b) => b.priority - a.priority,
+  });
+
+  addTask(task: Task): void {
+    this.maxPQ.add(task);
+  }
+
+  async start(): Promise<void> {
+    while (!this.maxPQ.isEmpty()) {
+      const task = this.maxPQ.poll();
+      if (!task) break;
+
+      try {
+        await task.action();
+        console.log(`Task ${task.id} completed (priority: ${task.priority})`);
+      } catch (error) {
+        console.error(`Task ${task.id} failed (priority: ${task.priority}):`, error);
+      }
+    }
+  }
+}
+```
+
+### Example 5: Search Index - Autocomplete
+
+```typescript
+import { Trie } from 'data-structure-typed';
+
+class SearchIndex {
+  private trie = new Trie();
+
+  indexDocument(docId: number, content: string): void {
+    const words = content.toLowerCase().split(/\s+/);
+
+    for (const word of words) {
+      const existing = this.trie.get(word);
+      if (!existing) {
+        this.trie.set(word, [docId]);
+      } else {
+        if (!existing.includes(docId)) {
+          existing.push(docId);
+        }
+        this.trie.set(word, existing);
+      }
+    }
+  }
+
+  autocomplete(prefix: string): string[] {
+    return this.trie.getWordsWithPrefix(prefix.toLowerCase());
+  }
+
+  search(word: string): number[] {
+    return this.trie.get(word.toLowerCase()) ?? [];
+  }
+}
+
+// Why Trie?
+// - O(m + k) prefix search (m = prefix length, k = results)
+// - Perfect for autocomplete
+// - Scales to millions of words
+```
+
+---
+
+## 🔄 Migration Guide: From Native JS
+
+### Pattern 1: Replacing Array.shift with Deque
+
+❌ Before:
+
+```javascript
+const queue = [1, 2, 3, 4, 5];
+for (let i = 0; i < 100000; i++) {
+  queue.shift();  // O(n)
+}
+```
+
+✅ After:
+
+```javascript
+import { Deque } from 'data-structure-typed';
+
+const deque = new Deque([1, 2, 3, 4, 5]);
+for (let i = 0; i < 100000; i++) {
+  deque.shift();  // O(1)
+}
+```
 
-### Conciseness and uniformity
+### Pattern 2: Replacing unsorted Map with RedBlackTree
 
-In [java.utils](), you need to memorize a table for all sequential data structures(Queue, Deque, LinkedList),
+❌ Before:
 
-<table style="display: table; width:100%; table-layout: fixed;">
-        <thead>
-            <tr>
-                <th>Java ArrayList</th>
-                <th>Java Queue</th>
-                <th>Java ArrayDeque</th>
-                <th>Java LinkedList</th>
-            </tr>
-        </thead>
-        <tbody>
-            <tr>
-                <td>add</td>
-                <td>offer</td>
-                <td>push</td>
-                <td>push</td>
-            </tr>
-            <tr>
-                <td>remove</td>
-                <td>poll</td>
-                <td>removeLast</td>
-                <td>removeLast</td>
-            </tr>
-            <tr>
-                <td>remove</td>
-                <td>poll</td>
-                <td>removeFirst</td>
-                <td>removeFirst</td>
-            </tr>
-            <tr>
-                <td>add(0, element)</td>
-                <td>offerFirst</td>
-                <td>unshift</td>
-                <td>unshift</td>
-            </tr>
-        </tbody>
-    </table>
-
-whereas in our [data-structure-typed](), you **only** need to remember four methods: `push`, `pop`, `shift`, and `unshift` for all sequential data structures(Queue, Deque, DoublyLinkedList, SinglyLinkedList and Array).
-
-### Data structures available
-
-We provide data structures that are not available in JS/TS
+```javascript
+const userMap = new Map([
+  [5, { id: 5, name: 'Alice' }],
+  [2, { id: 2, name: 'Bob' }],
+]);
+
+for (const [id, user] of userMap) {
+  console.log(id);  // 5, 2 (insertion order)
+}
+```
+
+✅ After:
+
+```javascript
+import { RedBlackTree } from 'data-structure-typed';
+
+const userTree = new RedBlackTree([
+  [5, { id: 5, name: 'Alice' }],
+  [2, { id: 2, name: 'Bob' }],
+]);
+
+for (const [id, user] of userTree) {
+  console.log(id);  // 2, 5 (sorted order)
+}
+```
+
+### Pattern 3: Replacing Array.sort with PriorityQueue
+
+❌ Before:
+
+```javascript
+const tasks = [];
+for (const task of incomingTasks) {
+  tasks.push(task);
+}
+tasks.sort((a, b) => b.priority - a.priority);  // O(n log n)
+```
+
+✅ After:
+
+```javascript
+import { MaxPriorityQueue } from 'data-structure-typed';
+
+const pq = new MaxPriorityQueue();
+for (const task of incomingTasks) {
+  pq.add(task);  // O(log n)
+}
+```
+
+---
+
+## 🎯 Decision Guide: Choose the Right Data Structure
+
+```
+Need frequent head/tail operations?
+  ↓
+  Yes → Deque (O(1) shift/unshift)
+  No  → Continue
+
+Need sorted + fast queries?
+  ↓
+  Yes → RedBlackTree (O(log n) search)
+  No  → Continue
+
+Need priority handling?
+  ↓
+  Yes → PriorityQueue (O(log n) add)
+  No  → Continue
+
+Need prefix matching?
+  ↓
+  Yes → Trie (O(m + k) search)
+  No  → Continue
+
+Need graph algorithms?
+  ↓
+  Yes → DirectedGraph / UndirectedGraph
+  No  → Use Array
+```
+
+---
+
+## 📊 Data Structures Available
 
 <table style="display: table; width:100%; table-layout: fixed;">
 <thead>
@@ -274,263 +1280,349 @@ We provide data structures that are not available in JS/TS
 <tbody>
 <tr>
 <td>Binary Tree</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryTree.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/binary-tree-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryTree.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/binary-tree-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/binary-tree-typed"></td>
 </tr>
 <tr>
 <td>Binary Search Tree (BST)</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/BST.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/bst-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/BST.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/bst-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/bst-typed"></td>
 </tr>
 <tr>
 <td>AVL Tree</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/AVLTree.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/avl-tree-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/AVLTree.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/avl-tree-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/avl-tree-typed"></td>
 </tr>
 <tr>
 <td>Red Black Tree</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/RedBlackTree.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/red-black-tree-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/RedBlackTree.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/red-black-tree-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/red-black-tree-typed"></td>
 </tr>
 <tr>
 <td>Tree Multimap</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/TreeMultiMap.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/tree-multimap-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/TreeMultiMap.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/tree-multimap-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/tree-multimap-typed"></td>
 </tr>
 <tr>
 <td>Heap</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/Heap.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/heap-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/Heap.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/heap-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/heap-typed"></td>
 </tr>
 <tr>
 <td>Priority Queue</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/PriorityQueue.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/priority-queue-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/PriorityQueue.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/priority-queue-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/priority-queue-typed"></td>
 </tr>
 <tr>
 <td>Max Priority Queue</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/MaxPriorityQueue.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/max-priority-queue-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/MaxPriorityQueue.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/max-priority-queue-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/max-priority-queue-typed"></td>
 </tr>
 <tr>
 <td>Min Priority Queue</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/MinPriorityQueue.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/min-priority-queue-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/MinPriorityQueue.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/min-priority-queue-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/min-priority-queue-typed"></td>
 </tr>
 <tr>
 <td>Trie</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/Trie.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/trie-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/Trie.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/trie-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/trie-typed"></td>
 </tr>
 <tr>
 <td>Graph</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/AbstractGraph.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/graph-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/AbstractGraph.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/graph-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/graph-typed"></td>
 </tr>
 <tr>
 <td>Directed Graph</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/DirectedGraph.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/directed-graph-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/DirectedGraph.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/directed-graph-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/directed-graph-typed"></td>
 </tr>
 <tr>
 <td>Undirected Graph</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/UndirectedGraph.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/undirected-graph-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/UndirectedGraph.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/undirected-graph-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/undirected-graph-typed"></td>
 </tr>
 <tr>
 <td>Queue</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/Queue.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/queue-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/Queue.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/queue-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/queue-typed"></td>
 </tr>
 <tr>
 <td>Deque</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/Deque.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/deque-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/Deque.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/deque-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/deque-typed"></td>
 </tr>
 <tr>
 <td>Hash Map</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/HashMap.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/hashmap-typed"><span></span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/HashMap.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/hashmap-typed">NPM</a></td>
 <td></td>
 </tr>
 <tr>
 <td>Linked List</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedList.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/linked-list-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedList.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/linked-list-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/linked-list-typed"></td>
 </tr>
 <tr>
 <td>Singly Linked List</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedList.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/singly-linked-list-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedList.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/singly-linked-list-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/singly-linked-list-typed"></td>
 </tr>
 <tr>
 <td>Doubly Linked List</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/DoublyLinkedList.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/doubly-linked-list-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/DoublyLinkedList.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/doubly-linked-list-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/doubly-linked-list-typed"></td>
 </tr>
 <tr>
 <td>Stack</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/Stack.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/stack-typed"><span>NPM</span></a></td>
+<td>✅</td>
+<td>✅</td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/Stack.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/stack-typed">NPM</a></td>
 <td><img alt="NPM Downloads" src="https://img.shields.io/npm/dm/stack-typed"></td>
 </tr>
 <tr>
 <td>Segment Tree</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+<td>✅</td>
 <td></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/SegmentTree.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/segment-tree-typed"><span></span></a></td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/SegmentTree.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/segment-tree-typed">NPM</a></td>
 <td></td>
 </tr>
 <tr>
 <td>Binary Indexed Tree</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+<td>✅</td>
 <td></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryIndexedTree.html"><span>Docs</span></a></td>
-<td><a href="https://www.npmjs.com/package/binary-indexed-tree-typed"><span></span></a></td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryIndexedTree.html">Docs</a></td>
+<td><a href="https://www.npmjs.com/package/binary-indexed-tree-typed">NPM</a></td>
 <td></td>
 </tr>
 </tbody>
 </table>
 
-## Vivid Examples
+---
 
-### AVL Tree
+## 🎨 Vivid Examples: Visual Demonstrations
+
+[Try it out](https://vivid-algorithm.vercel.app/), or you can run your own code using our [visual tool](https://github.com/zrwusa/vivid-algorithm)
 
-[Try it out](https://vivid-algorithm.vercel.app/), or you can run your own code using
-our [visual tool](https://github.com/zrwusa/vivid-algorithm)
+### AVL Tree
 
 ![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/avl-tree-test.webp)
 
 ### Tree Multi Map
 
-[Try it out](https://vivid-algorithm.vercel.app/)
-
 ![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/tree-multiset-test.webp)
 
 ### Directed Graph
 
-[Try it out](https://vivid-algorithm.vercel.app/algorithm/graph/)
-
 ![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/directed-graph-test.webp)
 
 ### Map Graph
 
-[Try it out](https://vivid-algorithm.vercel.app/algorithm/graph/)
-
 ![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/map-graph-test.webp)
 
-## Code Snippets
+---
 
-### Red Black Tree snippet
+## 🔗 Integration Examples
 
-#### TS
+### React: State Management with Sorted Data
 
-```ts
+```tsx
+import { useMemo, useState } from 'react';
 import { RedBlackTree } from 'data-structure-typed';
 
-const rbTree = new RedBlackTree<number>();
-rbTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
-rbTree.isAVLBalanced();    // true
-rbTree.delete(10);
-rbTree.isAVLBalanced();    // true
-rbTree.print()
-//         ___6________
-//        /            \
-//      ___4_       ___11________
-//     /     \     /             \
-//    _2_    5    _8_       ____14__
-//   /   \       /   \     /        \
-//   1   3       7   9    12__     15__
-//                            \        \
-//                           13       16
+type TodoItem = { id: number; title: string };
+
+export default function TodoList() {
+  const [todoTree, setTodoTree] = useState(
+    new RedBlackTree<number, TodoItem>([
+      [100, { id: 100, title: 'Title 100' }],
+      [1, { id: 1, title: 'Title 1' }],
+    ])
+  );
+
+  const todos = useMemo(() => [...todoTree.values()], [todoTree]);
+
+  const addTodo = () => {
+    setTodoTree((prev) => {
+      const next = prev.clone();
+      let id = Math.floor(Math.random() * 100);
+      while (next.has(id)) {
+        id = Math.floor(Math.random() * 100);
+      }
+      next.add(id, { id, title: `Title ${id}` });
+      return next;
+    });
+  };
+
+  const deleteTodo = (id: number) => {
+    setTodoTree((prev) => {
+      const next = prev.clone();
+      next.delete(id);
+      return next;
+    });
+  };
+
+  return (
+    <div>
+      <h2>Todo List (sorted by id)</h2>
+      {/* Component implementation */}
+    </div>
+  );
+}
 ```
 
-#### JS
+### Express.js: In-Memory Cache with LRU
+
+```typescript
+import express from 'express';
+import { DoublyLinkedList } from 'data-structure-typed';
+
+interface CacheEntry {
+  key: string;
+  value: any;
+}
+
+class ApiCache {
+  private cache = new DoublyLinkedList<CacheEntry>();
+  private keyMap = new Map<string, any>();
+  private maxSize = 1000;
+
+  set(key: string, value: any): void {
+    const entry: CacheEntry = { key, value };
+    this.cache.push(entry);
+    this.keyMap.set(key, value);
+
+    if (this.cache.size > this.maxSize) {
+      const oldest = this.cache.shift();
+      if (oldest) {
+        this.keyMap.delete(oldest.key);
+      }
+    }
+  }
+
+  get(key: string): any {
+    return this.keyMap.get(key);
+  }
+}
+
+const app = express();
+const cache = new ApiCache();
+
+app.get('/api/user/:id', (req, res) => {
+  const cacheKey = `user:${req.params.id}`;
+  let userData = cache.get(cacheKey);
+  if (!userData) {
+    userData = { id: req.params.id, name: 'User' };
+    cache.set(cacheKey, userData);
+  }
+  res.json(userData);
+});
+```
 
-```js
+### Nest.js: Service with Tree-Based Ranking
+
+```typescript
+import { Injectable } from '@nestjs/common';
 import { RedBlackTree } from 'data-structure-typed';
 
-const rbTree = new RedBlackTree();
-rbTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
-rbTree.isAVLBalanced();    // true
-rbTree.delete(10);
-rbTree.isAVLBalanced();    // true
-rbTree.print()
-//         ___6________
-//        /            \
-//      ___4_       ___11________
-//     /     \     /             \
-//    _2_    5    _8_       ____14__
-//   /   \       /   \     /        \
-//   1   3       7   9    12__     15__
-//                            \        \
-//                           13       16
+interface RankEntry {
+  userId: string;
+  score: number;
+}
+
+@Injectable()
+export class RankingService {
+  private rankingTree = new RedBlackTree<number, RankEntry>();
+
+  updateScore(userId: string, newScore: number): void {
+    const existing = [...this.rankingTree.values()].find(
+      (e) => e?.userId === userId
+    );
+
+    if (existing) {
+      this.rankingTree.delete(existing.score);
+    }
+
+    this.rankingTree.add(newScore, { userId, score: newScore });
+  }
+
+  getRanking(topN: number = 100): RankEntry[] | undefined {
+    return [...this.rankingTree.values()].reverse().slice(0, topN);
+  }
+
+  getUserRank(userId: string): number | null {
+    const allEntries = [...this.rankingTree.values()].reverse();
+    const index = allEntries.findIndex((e) => e?.userId === userId);
+    return index >= 0 ? index + 1 : null;
+  }
+}
 ```
 
-### Free conversion between data structures.
+---
+
+## Free Conversion Between Data Structures
 
 ```js
 const orgArr = [6, 1, 2, 7, 5, 3, 4, 9, 8];
-const orgStrArr = ["trie", "trial", "trick", "trip", "tree", "trend", "triangle", "track", "trace", "transmit"];
 const entries = [[6, "6"], [1, "1"], [2, "2"], [7, "7"], [5, "5"], [3, "3"], [4, "4"], [9, "9"], [8, "8"]];
 
 const queue = new Queue(orgArr);
@@ -581,7 +1673,6 @@ bst.print();
 //        \         \
 //        4         9
 
-
 const rbTree = new RedBlackTree(entries);
 rbTree.print();
 //     ___4___
@@ -592,7 +1683,6 @@ rbTree.print();
 //              /   \
 //              7   9
 
-
 const avl = new AVLTree(entries);
 avl.print();
 //     ___4___
@@ -653,611 +1743,147 @@ rbTree1.print();
 // 1    _4   6    _9
 //      /         /
 //      3         8
-
-
-const trie2 = new Trie(orgStrArr);
-trie2.print();
-// ['trie', 'trial', 'triangle', 'trick', 'trip', 'tree', 'trend', 'track', 'trace', 'transmit']
-const heap2 = new Heap(trie2, { comparator: (a, b) => Number(a) - Number(b) });
-heap2.print();
-// ['transmit', 'trace', 'tree', 'trend', 'track', 'trial', 'trip', 'trie', 'trick', 'triangle']
-const dq2 = new Deque(heap2);
-dq2.print();
-// ['transmit', 'trace', 'tree', 'trend', 'track', 'trial', 'trip', 'trie', 'trick', 'triangle']
-const entries2 = dq2.map((el, i) => [i, el]);
-const avl2 = new AVLTree(entries2);
-avl2.print();
-//     ___3_______
-//    /           \
-//   _1_       ___7_
-//  /   \     /     \
-//  0   2    _5_    8_
-//          /   \     \
-//          4   6     9
-```
-
-### Binary Search Tree (BST) snippet
-
-```ts
-import { BST, BSTNode } from 'data-structure-typed';
-
-const bst = new BST<number>();
-bst.add(11);
-bst.add(3);
-bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
-bst.size === 16;                // true
-bst.has(6);                     // true
-const node6 = bst.getNode(6);   // BSTNode
-bst.getHeight(6) === 2;         // true
-bst.getHeight() === 5;          // true
-bst.getDepth(6) === 3;          // true
-
-bst.getLeftMost()?.key === 1;   // true
-
-bst.delete(6);
-bst.get(6);                     // undefined
-bst.isAVLBalanced();            // true
-bst.bfs()[0] === 11;            // true
-bst.print()
-//       ______________11_____           
-//      /                     \          
-//   ___3_______            _13_____
-//  /           \          /        \    
-//  1_     _____8____     12      _15__
-//    \   /          \           /     \ 
-//    2   4_       _10          14    16
-//          \     /                      
-//          5_    9
-//            \                          
-//            7
-
-const objBST = new BST<number, { height: number, age: number }>();
-
-objBST.add(11, { "name": "Pablo", "size": 15 });
-objBST.add(3, { "name": "Kirk", "size": 1 });
-
-objBST.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5], [
-    { "name": "Alice", "size": 15 },
-    { "name": "Bob", "size": 1 },
-    { "name": "Charlie", "size": 8 },
-    { "name": "David", "size": 13 },
-    { "name": "Emma", "size": 16 },
-    { "name": "Frank", "size": 2 },
-    { "name": "Grace", "size": 6 },
-    { "name": "Hannah", "size": 9 },
-    { "name": "Isaac", "size": 12 },
-    { "name": "Jack", "size": 14 },
-    { "name": "Katie", "size": 4 },
-    { "name": "Liam", "size": 7 },
-    { "name": "Mia", "size": 10 },
-    { "name": "Noah", "size": 5 }
-  ]
-);
-
-objBST.delete(11);
-```
-
-### AVLTree snippet
-
-```ts
-import { AVLTree } from 'data-structure-typed';
-
-const avlTree = new AVLTree<number>();
-avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
-avlTree.isAVLBalanced();    // true
-avlTree.delete(10);
-avlTree.isAVLBalanced();    // true
 ```
 
-### Directed Graph simple snippet
+---
 
-```ts
-import { DirectedGraph } from 'data-structure-typed';
+## Supported Module System
 
-const graph = new DirectedGraph<string>();
+Now you can use it in Node.js and browser environments
 
-graph.addVertex('A');
-graph.addVertex('B');
+### Module Formats
 
-graph.hasVertex('A');       // true
-graph.hasVertex('B');       // true
-graph.hasVertex('C');       // false
+- **CommonJS**: `require export.modules =`
+- **ESModule**: `import export`
+- **TypeScript**: `import export`
+- **UMD**: `var Deque = dataStructureTyped.Deque`
 
-graph.addEdge('A', 'B');
-graph.hasEdge('A', 'B');    // true
-graph.hasEdge('B', 'A');    // false
+### CDN
 
-graph.deleteEdgeSrcToDest('A', 'B');
-graph.hasEdge('A', 'B');    // false
+#### Development
 
-graph.addVertex('C');
+##### ES Module
 
-graph.addEdge('A', 'B');
-graph.addEdge('B', 'C');
+```html
+<script type="module">
+  import { BST } from "https://cdn.jsdelivr.net/npm/data-structure-typed/dist/esm/index.mjs";
 
-const topologicalOrderKeys = graph.topologicalSort(); // ['A', 'B', 'C']
+  const bst = new BST([2, 1, 6, 7, 5, 3, 4, 8, 9]);
+  bst.print();
+</script>
 ```
 
-### Undirected Graph snippet
-
-```ts
-import { UndirectedGraph } from 'data-structure-typed';
-
-const graph = new UndirectedGraph<string>();
-graph.addVertex('A');
-graph.addVertex('B');
-graph.addVertex('C');
-graph.addVertex('D');
-graph.deleteVertex('C');
-graph.addEdge('A', 'B');
-graph.addEdge('B', 'D');
-
-const dijkstraResult = graph.dijkstra('A');
-Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.key) // ['A', 'B', 'D']
-
+##### UMD
 
+```html
+<script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.js'></script>
 ```
 
+#### Production
 
+```html
+<script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.min.js'></script>
 
-## API docs & Examples
-
-[API Docs](https://data-structure-typed-docs.vercel.app)
-
-[Live Examples](https://vivid-algorithm.vercel.app)
-
-<a href="https://github.com/zrwusa/vivid-algorithm" target="_blank">Examples Repository</a>
-
-## Benchmark
-
-MacBook Pro (15-inch, 2018)
-
-Processor 2.2 GHz 6-Core Intel Core i7
-
-Memory 16 GB 2400 MHz DDR4
-
-Graphics Radeon Pro 555X 4 GB
-
-Intel UHD Graphics 630 1536 MB
-
-macOS Sequoia 15.7.2
-
-## Performance & Runtime Compatibility
-
-[//]: # (No deletion!!! Start of Replace Section)
-
-<h2>red-black-tree</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>1,000,000 add</td><td>410.34</td><td>0.41</td><td>0.01</td></tr><tr><td>1,000,000 get</td><td>5.20</td><td>0.01</td><td>8.16e-5</td></tr><tr><td>1,000,000 iterator</td><td>154.25</td><td>0.15</td><td>0.02</td></tr><tr><td>CPT 1,000,000 add</td><td>656.43</td><td>0.66</td><td>0.00</td></tr><tr><td>CPT 1,000,000 add</td><td>684.17</td><td>0.68</td><td>0.01</td></tr></tbody></table><h2>queue</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>1,000,000 push</td><td>26.97</td><td>0.03</td><td>0.00</td></tr><tr><td>100,000 push & shift</td><td>2.87</td><td>0.00</td><td>2.71e-4</td></tr><tr><td>Native JS Array 100,000 push & shift</td><td>1120.94</td><td>1.12</td><td>0.20</td></tr></tbody></table><h2>deque</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>1,000,000 push</td><td>8.75</td><td>0.01</td><td>6.99e-4</td></tr><tr><td>1,000,000 push & pop</td><td>12.95</td><td>0.01</td><td>4.21e-4</td></tr><tr><td>1,000,000 push & shift</td><td>13.73</td><td>0.01</td><td>4.53e-4</td></tr><tr><td>100,000 push & shift</td><td>1.36</td><td>0.00</td><td>5.42e-5</td></tr><tr><td>Native JS Array 100,000 push & shift</td><td>1167.06</td><td>1.17</td><td>0.26</td></tr><tr><td>100,000 unshift & shift</td><td>1.31</td><td>0.00</td><td>4.73e-5</td></tr><tr><td>Native JS Array 100,000 unshift & shift</td><td>1911.47</td><td>1.91</td><td>0.02</td></tr></tbody></table><h2>heap</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>100,000 add</td><td>4.60</td><td>0.00</td><td>1.07e-4</td></tr><tr><td>100,000 add & poll</td><td>16.96</td><td>0.02</td><td>3.45e-4</td></tr></tbody></table><h2>avl-tree</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>100,000 add randomly</td><td>324.51</td><td>0.32</td><td>0.01</td></tr><tr><td>100,000 add</td><td>299.76</td><td>0.30</td><td>0.02</td></tr><tr><td>100,000 get</td><td>0.26</td><td>2.58e-4</td><td>3.65e-6</td></tr><tr><td>100,000 getNode</td><td>169.33</td><td>0.17</td><td>0.00</td></tr><tr><td>100,000 iterator</td><td>14.43</td><td>0.01</td><td>0.00</td></tr><tr><td>100,000 add & delete orderly</td><td>434.44</td><td>0.43</td><td>0.01</td></tr><tr><td>100,000 add & delete randomly</td><td>541.78</td><td>0.54</td><td>0.01</td></tr></tbody></table><h2>hash-map</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>1,000,000 set</td><td>43.23</td><td>0.04</td><td>0.01</td></tr><tr><td>Native JS Map 1,000,000 set</td><td>147.12</td><td>0.15</td><td>0.01</td></tr><tr><td>Native JS Set 1,000,000 add</td><td>116.18</td><td>0.12</td><td>0.01</td></tr><tr><td>1,000,000 set & get</td><td>46.39</td><td>0.05</td><td>0.01</td></tr><tr><td>Native JS Map 1,000,000 set & get</td><td>196.92</td><td>0.20</td><td>0.01</td></tr><tr><td>Native JS Set 1,000,000 add & has</td><td>163.92</td><td>0.16</td><td>0.01</td></tr><tr><td>1,000,000 ObjKey set & get</td><td>243.36</td><td>0.24</td><td>0.03</td></tr><tr><td>Native JS Map 1,000,000 ObjKey set & get</td><td>211.66</td><td>0.21</td><td>0.02</td></tr><tr><td>Native JS Set 1,000,000 ObjKey add & has</td><td>196.57</td><td>0.20</td><td>0.01</td></tr></tbody></table><h2>directed-graph</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>1,000 addVertex</td><td>0.05</td><td>4.60e-5</td><td>6.59e-7</td></tr><tr><td>1,000 addEdge</td><td>3.02</td><td>0.00</td><td>2.85e-4</td></tr><tr><td>1,000 getVertex</td><td>0.04</td><td>3.77e-5</td><td>4.66e-7</td></tr><tr><td>1,000 getEdge</td><td>41.48</td><td>0.04</td><td>0.01</td></tr><tr><td>tarjan</td><td>240.33</td><td>0.24</td><td>0.01</td></tr><tr><td>topologicalSort</td><td>195.62</td><td>0.20</td><td>0.01</td></tr></tbody></table><h2>trie</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>100,000 push</td><td>27.15</td><td>0.03</td><td>6.61e-4</td></tr><tr><td>100,000 getWords</td><td>41.18</td><td>0.04</td><td>0.00</td></tr></tbody></table><h2>stack</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>1,000,000 push</td><td>25.21</td><td>0.03</td><td>0.00</td></tr><tr><td>1,000,000 push & pop</td><td>29.12</td><td>0.03</td><td>0.00</td></tr></tbody></table>
-
-[//]: # (No deletion!!! End of Replace Section)
-
-
-## The corresponding relationships between data structures in different language standard libraries.
+<script>
+  const { Heap } = dataStructureTyped;
+  const { BinaryTree, Graph, Queue, Stack } = dataStructureTyped;
+  
+  const heap = new Heap([1, 2, 3]);
+  heap.print();
+</script>
+```
 
-<table style="display: table; width:100%; table-layout: fixed;">
-  <thead>
-  <tr>
-    <th>Data Structure Typed</th>
-    <th>C++ STL</th>
-    <th>java.util</th>
-    <th>Python collections</th>
-  </tr>
-  </thead>
-  <tbody>
-  <tr>
-    <td>Heap&lt;E&gt;</td>
-    <td>-</td>
-    <td>-</td>
-    <td>heapq</td>
-  </tr>
-  <tr>
-    <td>PriorityQueue&lt;E&gt;</td>
-    <td>priority_queue&lt;T&gt;</td>
-    <td>PriorityQueue&lt;E&gt;</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>Deque&lt;E&gt;</td>
-    <td>deque&lt;T&gt;</td>
-    <td>ArrayDeque&lt;E&gt;</td>
-    <td>deque</td>
-  </tr>
-  <tr>
-    <td>Queue&lt;E&gt;</td>
-    <td>queue&lt;T&gt;</td>
-    <td>Queue&lt;E&gt;</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>HashMap&lt;K, V&gt;</td>
-    <td>unordered_map&lt;K, V&gt;</td>
-    <td>HashMap&lt;K, V&gt;</td>
-    <td>defaultdict</td>
-  </tr>
-  <tr>
-    <td>DoublyLinkedList&lt;E&gt;</td>
-    <td>list&lt;T&gt;</td>
-    <td>LinkedList&lt;E&gt;</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>SinglyLinkedList&lt;E&gt;</td>
-    <td>-</td>
-    <td>-</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>BinaryTree&lt;K, V&gt;</td>
-    <td>-</td>
-    <td>-</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>BST&lt;K, V&gt;</td>
-    <td>-</td>
-    <td>-</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>RedBlackTree&lt;E&gt;</td>
-    <td>set&lt;T&gt;</td>
-    <td>TreeSet&lt;E&gt;</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>RedBlackTree&lt;K, V&gt;</td>
-    <td>map&lt;K, V&gt;</td>
-    <td>TreeMap&lt;K, V&gt;</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>TreeMultiMap&lt;K, V&gt;</td>
-    <td>multimap&lt;K, V&gt;</td>
-    <td>-</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>TreeMultiMap&lt;E&gt;</td>
-    <td>multiset&lt;T&gt;</td>
-    <td>-</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>Trie</td>
-    <td>-</td>
-    <td>-</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>DirectedGraph&lt;V, E&gt;</td>
-    <td>-</td>
-    <td>-</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>UndirectedGraph&lt;V, E&gt;</td>
-    <td>-</td>
-    <td>-</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>PriorityQueue&lt;E&gt;</td>
-    <td>priority_queue&lt;T&gt;</td>
-    <td>PriorityQueue&lt;E&gt;</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>Array&lt;E&gt;</td>
-    <td>vector&lt;T&gt;</td>
-    <td>ArrayList&lt;E&gt;</td>
-    <td>list</td>
-  </tr>
-  <tr>
-    <td>Stack&lt;E&gt;</td>
-    <td>stack&lt;T&gt;</td>
-    <td>Stack&lt;E&gt;</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>HashMap&lt;E&gt;</td>
-    <td>unordered_set&lt;T&gt;</td>
-    <td>HashSet&lt;E&gt;</td>
-    <td>set</td>
-  </tr>
-  <tr>
-    <td>-</td>
-    <td>unordered_multiset</td>
-    <td>-</td>
-    <td>Counter</td>
-  </tr>
-  <tr>
-    <td>ES6 Map&lt;K, V&gt;</td>
-    <td>-</td>
-    <td>LinkedHashMap&lt;K, V&gt;</td>
-    <td>OrderedDict</td>
-  </tr>
-  <tr>
-    <td>-</td>
-    <td>unordered_multimap&lt;K, V&gt;</td>
-    <td>-</td>
-    <td>-</td>
-  </tr>
-  <tr>
-    <td>-</td>
-    <td>bitset&lt;N&gt;</td>
-    <td>-</td>
-    <td>-</td>
-  </tr>
-  </tbody>
-</table>
+---
 
-## Built-in classic algorithms
+## Design Principles
 
 <table style="display: table; width:100%; table-layout: fixed;">
-  <thead>
-  <tr>
-    <th>Algorithm</th>
-    <th>Function Description</th>
-    <th>Iteration Type</th>
-  </tr>
-  </thead>
-  <tbody>
   <tr>
-    <td>Binary Tree DFS</td>
-    <td>Traverse a binary tree in a depth-first manner, starting from the root node, first visiting the left subtree,
-      and then the right subtree, using recursion.
-    </td>
-    <td>Recursion + Iteration</td>
+    <th>Principle</th>
+    <th>Description</th>
   </tr>
   <tr>
-    <td>Binary Tree BFS</td>
-    <td>Traverse a binary tree in a breadth-first manner, starting from the root node, visiting nodes level by level
-      from left to right.
-    </td>
-    <td>Iteration</td>
+    <td>Practicality</td>
+    <td>Follows ES6 and ESNext standards, offering unified and considerate optional parameters, and simplifies method names.</td>
   </tr>
   <tr>
-    <td>Graph DFS</td>
-    <td>Traverse a graph in a depth-first manner, starting from a given node, exploring along one path as deeply as
-      possible, and backtracking to explore other paths. Used for finding connected components, paths, etc.
-    </td>
-    <td>Recursion + Iteration</td>
+    <td>Extensibility</td>
+    <td>Adheres to OOP (Object-Oriented Programming) principles, allowing inheritance for all data structures.</td>
   </tr>
   <tr>
-    <td>Binary Tree Morris</td>
-    <td>Morris traversal is an in-order traversal algorithm for binary trees with O(1) space complexity. It allows tree
-      traversal without additional stack or recursion.
-    </td>
-    <td>Iteration</td>
+    <td>Modularization</td>
+    <td>Includes data structure modularization and independent NPM packages.</td>
   </tr>
   <tr>
-    <td>Graph BFS</td>
-    <td>Traverse a graph in a breadth-first manner, starting from a given node, first visiting nodes directly connected
-      to the starting node, and then expanding level by level. Used for finding shortest paths, etc.
-    </td>
-    <td>Recursion + Iteration</td>
+    <td>Efficiency</td>
+    <td>All methods provide time and space complexity, comparable to native JS performance.</td>
   </tr>
   <tr>
-    <td>Graph Tarjan's Algorithm</td>
-    <td>Find strongly connected components in a graph, typically implemented using depth-first search.</td>
-    <td>Recursion</td>
+    <td>Maintainability</td>
+    <td>Follows open-source community development standards, complete documentation, continuous integration, and adheres to TDD (Test-Driven Development) patterns.</td>
   </tr>
   <tr>
-    <td>Graph Bellman-Ford Algorithm</td>
-    <td>Finding the shortest paths from a single source, can handle negative weight edges</td>
-    <td>Iteration</td>
+    <td>Testability</td>
+    <td>Automated and customized unit testing, performance testing, and integration testing.</td>
   </tr>
   <tr>
-    <td>Graph Dijkstra's Algorithm</td>
-    <td>Finding the shortest paths from a single source, cannot handle negative weight edges</td>
-    <td>Iteration</td>
+    <td>Portability</td>
+    <td>Plans for porting to Java, Python, and C++, currently achieved to 80%.</td>
   </tr>
   <tr>
-    <td>Graph Floyd-Warshall Algorithm</td>
-    <td>Finding the shortest paths between all pairs of nodes</td>
-    <td>Iteration</td>
+    <td>Reusability</td>
+    <td>Fully decoupled, minimized side effects, and adheres to OOP.</td>
   </tr>
   <tr>
-    <td>Graph getCycles</td>
-    <td>Find all cycles in a graph or detect the presence of cycles.</td>
-    <td>Recursion</td>
+    <td>Security</td>
+    <td>Carefully designed security for member variables and methods. Read-write separation. Data structure software does not need to consider other security aspects.</td>
   </tr>
   <tr>
-    <td>Graph getCutVertices</td>
-    <td>Find cut vertices in a graph, which are nodes that, when removed, increase the number of connected components in
-      the graph.
-    </td>
-    <td>Recursion</td>
+    <td>Scalability</td>
+    <td>Data structure software does not involve load issues.</td>
   </tr>
-  <tr>
-    <td>Graph getSCCs</td>
-    <td>Find strongly connected components in a graph, which are subgraphs where any two nodes can reach each other.
-    </td>
-    <td>Recursion</td>
-  </tr>
-  <tr>
-    <td>Graph getBridges</td>
-    <td>Find bridges in a graph, which are edges that, when removed, increase the number of connected components in the
-      graph.
-    </td>
-    <td>Recursion</td>
-  </tr>
-  <tr>
-    <td>Graph topologicalSort</td>
-    <td>Perform topological sorting on a directed acyclic graph (DAG) to find a linear order of nodes such that all
-      directed edges go from earlier nodes to later nodes.
-    </td>
-    <td>Recursion</td>
-  </tr>
-  </tbody>
 </table>
 
-Starting from v2.2.0, `data-structure-typed` ships **two runtime targets** to balance
-maximum performance on modern engines with broad compatibility for older Node.js
-and browsers.
-
-### Build Targets
-
-| Target | Output | Recommended runtime | Minimum runtime | Notes |
-|---|---|---:|---:|---|
-| **Modern (ES2022)** | `dist/esm` / `dist/cjs` | **Node.js 18+** | Node.js 16+ | Best performance. Enables V8 to fully optimize hot paths (JIT-friendly class semantics). |
-| **Legacy (ES2018)** | `dist/esm-legacy` / `dist/cjs-legacy` | Node.js 16+ | **Node.js 12+** | Maximum compatibility. Slightly slower due to older compilation target and reduced JIT opportunities. |
+---
 
-### Benchmarks (Insertion-heavy workloads)
+## 🔧 TypeScript Support
 
-The modern build (ES2022) is significantly faster for insertion-heavy operations
-(e.g. Red-Black Tree `add/insert`) because it avoids performance overhead from
-transpiled class field initialization and improves JIT optimization.
+Full type safety with automatic type inference:
 
-| Benchmark | Legacy (ES2018) | Modern (ES2022) | Speedup |
-|---|---:|---:|---:|
-| Red-Black Tree `add` (1,000,000 inserts) | **~1100 ms** *(example)* | **473.12 ms** | **~2.3×** |
+```typescript
+// Generic type parameters
+const bst = new BST<number, { name: string }>();
+bst.add(10, { name: 'Alice' });
 
-> Notes:
-> - Results vary by hardware and Node version.
-> - We recommend running benchmarks on **Node.js 18+** for stable, modern V8 behavior.
+// Type-safe retrieval
+const value: { name: string } | undefined = bst.get(10);
 
-### Node.js Support Policy
+// Custom comparator
+const descBST = new BST<number>([], (a, b) => b - a);
 
-- **Supported:** Node.js **12+** (via the legacy build)
-- **Recommended:** Node.js **18+** (modern build, best performance and stability)
-- **Best experience:** Node.js **20+** (latest V8 improvements)
-
-If you target Node.js 18+ only, you will get the best performance out of the box.
-
-### Browser Support
-
-- **Modern browsers (Evergreen):** use the **Modern (ES2022)** ESM build.
-- **Older browsers / conservative bundlers:** use the **Legacy (ES2018)** ESM build.
-
-In most bundler setups, the correct build is resolved automatically via `exports`.
-If you need to force a specific target, use the explicit entry points:
-
-```js
-// Force modern build (ES2022)
-import { RedBlackTree } from "data-structure-typed/modern";
-
-// Force legacy build (ES2018)
-import { RedBlackTree } from "data-structure-typed/legacy";
-```
-
-Just run
-
-```shell
-pnpm test:perf red-black-tree.test.ts
-```
-
-```html
-1,000,000 add randomly: 1.141s
-1,000,000 add: 374.859ms
-1,000,000 get: 5.99ms
+// Full IDE autocomplete support
+tree.map(x => x * 2);  // TypeScript knows the signature
 ```
 
-## Software Engineering Design Standards
-
-We strictly adhere to computer science theory and software development standards. Our LinkedList is designed in the
-traditional sense of the LinkedList data structure, and we refrain from substituting it with a Deque solely for the
-purpose of showcasing performance test data. However, we have also implemented a Deque based on a dynamic array
-concurrently.
-
-
-<table style="display: table; width:100%; table-layout: fixed;">
-    <tr>
-        <th>Principle</th>
-        <th>Description</th>
-    </tr>
-    <tr>
-        <td>Practicality</td>
-        <td>Follows ES6 and ESNext standards, offering unified and considerate optional parameters, and simplifies method names.</td>
-    </tr>
-    <tr>
-        <td>Extensibility</td>
-        <td>Adheres to OOP (Object-Oriented Programming) principles, allowing inheritance for all data structures.</td>
-    </tr>
-    <tr>
-        <td>Modularization</td>
-        <td>Includes data structure modularization and independent NPM packages.</td>
-    </tr>
-    <tr>
-        <td>Efficiency</td>
-        <td>All methods provide time and space complexity, comparable to native JS performance.</td>
-    </tr>
-    <tr>
-        <td>Maintainability</td>
-        <td>Follows open-source community development standards, complete documentation, continuous integration, and adheres to TDD (Test-Driven Development) patterns.</td>
-    </tr>
-    <tr>
-        <td>Testability</td>
-        <td>Automated and customized unit testing, performance testing, and integration testing.</td>
-    </tr>
-    <tr>
-        <td>Portability</td>
-        <td>Plans for porting to Java, Python, and C++, currently achieved to 80%.</td>
-    </tr>
-    <tr>
-        <td>Reusability</td>
-        <td>Fully decoupled, minimized side effects, and adheres to OOP.</td>
-    </tr>
-    <tr>
-        <td>Security</td>
-        <td>Carefully designed security for member variables and methods. Read-write separation. Data structure software does not need to consider other security aspects.</td>
-    </tr>
-    <tr>
-        <td>Scalability</td>
-        <td>Data structure software does not involve load issues.</td>
-    </tr>
-</table>
-
-## supported module system
-
-Now you can use it in Node.js and browser environments
-
-CommonJS:**`require export.modules =`**
-
-ESModule:&nbsp;&nbsp;&nbsp;**`import export`**
-
-Typescript:&nbsp;&nbsp;&nbsp;**`import export`**
-
-UMD:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;**`var Deque = dataStructureTyped.Deque`**
-
-### CDN
-
-Copy the line below into the head tag in an HTML document.
-
-#### development
-
-##### ES Module
-
-```html
+---
 
-<script type="module">
-  import { BST } from "https://cdn.jsdelivr.net/npm/data-structure-typed/dist/esm/index.mjs";
+## 📞 Feedback and Contributions
 
-  const bst = new BST([2, 1, 6, 7, 5, 3, 4, 8, 9]);
-  bst.print();
-</script>
-```
+This library is maintained with care. Found an issue or have a suggestion? We welcome all feedback!
 
-##### UMD
+- **Issues**: [GitHub Issues](https://github.com/zrwusa/data-structure-typed/issues)
+- **Discussions**: [GitHub Discussions](https://github.com/zrwusa/data-structure-typed/discussions)
 
-```html
+---
 
-<script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.js'></script>
-```
+## 📄 License
 
-#### production
+[MIT License](LICENSE)
 
-```html
+---
 
-<script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.min.js'></script>
-```
+## 🙏 Thank You
 
-Copy the code below into the script tag of your HTML, and you're good to go with your development.
+Thank you for using **data-structure-typed**. We hope it makes your coding journey more productive and enjoyable!
 
-```js
-const { Heap } = dataStructureTyped;
-const {
-  BinaryTree, Graph, Queue, Stack, PriorityQueue, BST, Trie, DoublyLinkedList,
-  AVLTree, MinHeap, SinglyLinkedList, DirectedGraph, TreeMultiMap,
-  DirectedVertex, AVLTreeNode
-} = dataStructureTyped;
-```
+Happy coding! 🚀