diff --git a/codes/javascript/chapter_stack_and_queue/array_queue.js b/codes/javascript/chapter_stack_and_queue/array_queue.js
new file mode 100644
index 000000000..902c74079
--- /dev/null
+++ b/codes/javascript/chapter_stack_and_queue/array_queue.js
@@ -0,0 +1,123 @@
+/**
+ * File: array_queue.js
+ * Created Time: 2022-12-13
+ * Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com)
+ */
+
+
+/* 基于环形数组实现的队列 */
+class ArrayQueue {
+    #queue;           // 用于存储队列元素的数组
+    #front = 0;       // 头指针，指向队首
+    #rear = 0;        // 尾指针，指向队尾 + 1
+    #CAPACITY = 1e3;  // 默认初始容量
+
+    constructor(capacity) {
+        this.#queue = new Array(capacity ?? this.CAPACITY);
+    }
+
+    /* 获取队列的容量 */
+    get capacity() {
+        return this.#queue.length;
+    }
+
+    /* 获取队列的长度 */
+    get size() {
+        // 由于将数组看作为环形，可能 rear < front ，因此需要取余数
+        return (this.capacity + this.#rear - this.#front) % this.capacity;
+    }
+
+    /* 判断队列是否为空 */
+    empty() {
+        return this.#rear - this.#front == 0;
+    }
+
+    /* 入队 */
+    offer(num) {
+        if (this.size == this.capacity)
+            throw new Error("队列已满");
+        // 尾结点后添加 num
+        this.#queue[this.#rear] = num;
+        // 尾指针向后移动一位，越过尾部后返回到数组头部
+        this.#rear = (this.#rear + 1) % this.capacity;
+    }
+
+    /* 出队 */
+    poll() {
+        const num = this.peek();
+        // 队头指针向后移动一位，若越过尾部则返回到数组头部
+        this.#front = (this.#front + 1) % this.capacity;
+        return num;
+    }
+
+    /* 访问队首元素 */
+    peek() {
+        // 删除头结点
+        if (this.empty())
+            throw new Error("队列为空");
+        return this.#queue[this.#front];
+    }
+
+    /* 访问指定索引元素 */
+    get(index) {
+        if (index >= this.size)
+            throw new Error("索引越界");
+        return this.#queue[(this.#front + index) % this.capacity];
+    }
+
+    /* 返回 Array */
+    toArray() {
+        const siz = this.size;
+        const cap = this.capacity;
+        // 仅转换有效长度范围内的列表元素
+        const arr = new Array(siz);
+        for (let i = 0, j = this.#front; i < siz; i++, j++) {
+            arr[i] = this.#queue[j % cap];
+        }
+        return arr;
+    }
+}
+
+
+/* Driver Code */
+/* 初始化队列 */
+const capacity = 10;
+const queue = new ArrayQueue(capacity);
+
+/* 元素入队 */
+queue.offer(1);
+queue.offer(3);
+queue.offer(2);
+queue.offer(5);
+queue.offer(4);
+console.log("队列 queue = ");
+console.log(queue.toArray());
+
+/* 访问队首元素 */
+const peek = queue.peek();
+console.log("队首元素 peek = " + peek);
+
+/* 访问指定索引元素 */
+const num = queue.get(2);
+console.log("队列第 3 个元素为 num = " + num);
+
+/* 元素出队 */
+const poll = queue.poll();
+console.log("出队元素 poll = " + poll + "，出队后 queue = ");
+console.log(queue.toArray());
+
+/* 获取队列的长度 */
+const size = queue.size;
+console.log("队列长度 size = " + size);
+
+/* 判断队列是否为空 */
+const empty = queue.empty();
+console.log("队列是否为空 = " + empty);
+
+/* 测试环形数组 */
+for (let i = 0; i < 10; i++) {
+    queue.offer(i);
+    queue.poll();
+    console.log("第 " + i + " 轮入队 + 出队后 queue = ");
+    console.log(queue.toArray());
+}
diff --git a/codes/javascript/chapter_stack_and_queue/linkedlist_queue.js b/codes/javascript/chapter_stack_and_queue/linkedlist_queue.js
new file mode 100644
index 000000000..cf1f3b3de
--- /dev/null
+++ b/codes/javascript/chapter_stack_and_queue/linkedlist_queue.js
@@ -0,0 +1,103 @@
+/**
+ * File: linkedlist_queue.js
+ * Created Time: 2022-12-20
+ * Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com)
+ */
+
+const ListNode = require("../include/ListNode");
+
+/* 基于链表实现的队列 */
+class LinkedListQueue {
+    #front;
+    #rear;  // 头结点 #front ，尾结点 #rear 
+    #queSize = 0;
+
+    constructor() {
+        this.#front = null;
+        this.#rear = null;
+    }
+
+    /* 获取队列的长度 */
+    get size() {
+        return this.#queSize;
+    }
+
+    /* 判断队列是否为空 */
+    isEmpty() {
+        return this.size === 0;
+    }
+
+    /* 入队 */
+    offer(num) {
+        // 尾结点后添加 num
+        const node = new ListNode(num);
+        // 如果队列为空，则令头、尾结点都指向该结点
+        if (!this.#front) {
+            this.#front = node;
+            this.#rear = node;
+            // 如果队列不为空，则将该结点添加到尾结点后
+        } else {
+            this.#rear.next = node;
+            this.#rear = node;
+        }
+        this.#queSize++;
+    }
+
+    /* 出队 */
+    poll() {
+        const num = this.peek();
+        if (!this.#front) {
+            throw new Error("队列为空")
+        }
+        // 删除头结点
+        this.#front = this.#front.next;
+        this.#queSize--;
+        return num;
+    }
+
+    /* 访问队首元素 */
+    peek() {
+        if (this.size === 0)
+            throw new Error("队列为空");
+        return this.#front.val;
+    }
+
+    /* 将链表转化为 Array 并返回 */
+    toArray() {
+        let node = this.#front;
+        const res = new Array(this.size);
+        for (let i = 0; i < res.length; i++) {
+            res[i] = node.val;
+            node = node.next;
+        }
+        return res;
+    }
+}
+
+
+/* 初始化队列 */
+const queue = new LinkedListQueue();
+
+/* 元素入队 */
+queue.offer(1);
+queue.offer(3);
+queue.offer(2);
+queue.offer(5);
+queue.offer(4);
+console.log("队列 queue = " + queue.toArray());
+
+/* 访问队首元素 */
+const peek = queue.peek();
+console.log("队首元素 peek = " + peek);
+
+/* 元素出队 */
+const poll = queue.poll();
+console.log("出队元素 poll = " + poll + "，出队后 queue = " + queue.toArray());
+
+/* 获取队列的长度 */
+const size = queue.size;
+console.log("队列长度 size = " + size);
+
+/* 判断队列是否为空 */
+const isEmpty = queue.isEmpty();
+console.log("队列是否为空 = " + isEmpty);
diff --git a/codes/javascript/chapter_stack_and_queue/queue.js b/codes/javascript/chapter_stack_and_queue/queue.js
index 5d26727f1..7d4aeeeef 100644
--- a/codes/javascript/chapter_stack_and_queue/queue.js
+++ b/codes/javascript/chapter_stack_and_queue/queue.js
@@ -4,6 +4,8 @@
  * Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com)
  */
 
+
+/* Driver Code */
 /* 初始化队列 */
 // JavaScript 没有内置的队列，可以把 Array 当作队列来使用 
 // 注意：由于是数组，所以 shift() 的时间复杂度是 O(n)
@@ -20,7 +22,7 @@ queue.push(4);
 const peek = queue[0];
 
 /* 元素出队 */
-// O(n)
+// shift() 方法的时间复杂度为 O(n)
 const poll = queue.shift();
 
 /* 获取队列的长度 */
diff --git a/codes/typescript/chapter_stack_and_queue/array_queue.ts b/codes/typescript/chapter_stack_and_queue/array_queue.ts
new file mode 100644
index 000000000..789d2d99f
--- /dev/null
+++ b/codes/typescript/chapter_stack_and_queue/array_queue.ts
@@ -0,0 +1,125 @@
+/**
+ * File: array_queue.ts
+ * Created Time: 2022-12-11
+ * Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com)
+ */
+
+
+/* 基于环形数组实现的队列 */
+class ArrayQueue {
+    private queue: number[];     // 用于存储队列元素的数组
+    private front: number = 0;  // 头指针，指向队首
+    private rear: number = 0;   // 尾指针，指向队尾 + 1
+    private CAPACITY: number = 1e5;
+
+    constructor(capacity?: number) {
+        this.queue = new Array<number>(capacity ?? this.CAPACITY);
+    }
+
+    /* 获取队列的容量 */
+    get capacity(): number {
+        return this.queue.length;
+    }
+
+    /* 获取队列的长度 */
+    get size(): number {
+        // 由于将数组看作为环形，可能 rear < front ，因此需要取余数
+        return (this.capacity + this.rear - this.front) % this.capacity;
+    }
+
+    /* 判断队列是否为空 */
+    empty(): boolean {
+        return this.rear - this.front == 0;
+    }
+
+    /* 入队 */
+    offer(num: number): void {
+        if (this.size == this.capacity) {
+            console.log("队列已满");
+            return;
+        }
+        // 尾结点后添加 num
+        this.queue[this.rear] = num;
+        // 尾指针向后移动一位，越过尾部后返回到数组头部
+        this.rear = (this.rear + 1) % this.capacity;
+    }
+
+    /* 出队 */
+    poll(): number {
+        const num = this.peek();
+        // 队头指针向后移动一位，若越过尾部则返回到数组头部
+        this.front = (this.front + 1) % this.capacity;
+        return num;
+    }
+
+    /* 访问队首元素 */
+    peek(): number {
+        // 删除头结点
+        if (this.empty())
+            throw new Error("The queue is empty!");
+        return this.queue[this.front];
+    }
+
+    /* 访问指定索引元素 */
+    get(index: number): number {
+        if (index >= this.size)
+            throw new Error("Index out of bounds!");
+        return this.queue[(this.front + index) % this.capacity];
+    }
+
+    /* 返回 Array */
+    toArray(): number[] {
+        const siz = this.size;
+        const cap = this.capacity;
+        // 仅转换有效长度范围内的列表元素
+        const arr = new Array(siz);
+        for (let i = 0, j = this.front; i < siz; i++, j++) {
+            arr[i] = this.queue[j % cap];
+        }
+        return arr;
+    }
+}
+
+/* 初始化队列 */
+const capacity = 10;
+const queue = new ArrayQueue(capacity);
+
+/* 元素入队 */
+queue.offer(1);
+queue.offer(3);
+queue.offer(2);
+queue.offer(5);
+queue.offer(4);
+console.log("队列 queue = ");
+console.log(queue.toArray());
+
+/* 访问队首元素 */
+const peek = queue.peek();
+console.log("队首元素 peek = " + peek);
+
+/* 访问指定索引元素 */
+const num = queue.get(2);
+console.log("队列第 3 个元素为 num = " + num);
+
+/* 元素出队 */
+const poll = queue.poll();
+console.log("出队元素 poll = " + poll + "，出队后 queue = ");
+console.log(queue.toArray());
+
+/* 获取队列的长度 */
+const size = queue.size;
+console.log("队列长度 size = " + size);
+
+/* 判断队列是否为空 */
+const empty = queue.empty();
+console.log("队列是否为空 = " + empty);
+
+/* 测试环形数组 */
+for (let i = 0; i < 10; i++) {
+    queue.offer(i);
+    queue.poll();
+    console.log("第 " + i + " 轮入队 + 出队后 queue = ");
+    console.log(queue.toArray());
+}
+
+export { };
\ No newline at end of file
diff --git a/codes/typescript/chapter_stack_and_queue/linkedlist_queue.ts b/codes/typescript/chapter_stack_and_queue/linkedlist_queue.ts
new file mode 100644
index 000000000..01e93b063
--- /dev/null
+++ b/codes/typescript/chapter_stack_and_queue/linkedlist_queue.ts
@@ -0,0 +1,103 @@
+/**
+ * File: linkedlist_queue.ts
+ * Created Time: 2022-12-19
+ * Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com)
+ */
+
+import ListNode from "../module/ListNode"
+
+/* 基于链表实现的队列 */
+class LinkedListQueue {
+    private front: ListNode | null;
+    private rear: ListNode | null;  // 头结点 front ，尾结点 rear 
+    private queSize: number = 0;
+
+    constructor() {
+        this.front = null;
+        this.rear = null;
+    }
+
+    /* 获取队列的长度 */
+    get size(): number {
+        return this.queSize;
+    }
+
+    /* 判断队列是否为空 */
+    isEmpty(): boolean {
+        return this.size === 0;
+    }
+
+    /* 入队 */
+    offer(num: number): void {
+        // 尾结点后添加 num
+        const node = new ListNode(num);
+        // 如果队列为空，则令头、尾结点都指向该结点
+        if (!this.front) {
+            this.front = node;
+            this.rear = node;
+            // 如果队列不为空，则将该结点添加到尾结点后
+        } else {
+            this.rear!.next = node;
+            this.rear = node;
+        }
+        this.queSize++;
+    }
+
+    /* 出队 */
+    poll(): number {
+        const num = this.peek();
+        if (!this.front) {
+            throw new Error("No element in queue!")
+        }
+        // 删除头结点
+        this.front = this.front.next;
+        this.queSize--;
+        return num;
+    }
+
+    /* 访问队首元素 */
+    peek(): number {
+        if (this.size === 0)
+            throw new Error("No element in queue!");
+        return this.front!.val;
+    }
+
+    /* 将链表转化为 Array 并返回 */
+    toArray(): number[] {
+        let node = this.front;
+        const res = new Array<number>(this.size);
+        for (let i = 0; i < res.length; i++) {
+            res[i] = node!.val;
+            node = node!.next;
+        }
+        return res;
+    }
+}
+
+
+/* 初始化队列 */
+const queue = new LinkedListQueue();
+
+/* 元素入队 */
+queue.offer(1);
+queue.offer(3);
+queue.offer(2);
+queue.offer(5);
+queue.offer(4);
+console.log("队列 queue = " + queue.toArray());
+
+/* 访问队首元素 */
+const peek = queue.peek();
+console.log("队首元素 peek = " + peek);
+
+/* 元素出队 */
+const poll = queue.poll();
+console.log("出队元素 poll = " + poll + "，出队后 queue = " + queue.toArray());
+
+/* 获取队列的长度 */
+const size = queue.size;
+console.log("队列长度 size = " + size);
+
+/* 判断队列是否为空 */
+const isEmpty = queue.isEmpty();
+console.log("队列是否为空 = " + isEmpty);
diff --git a/docs/chapter_stack_and_queue/queue.md b/docs/chapter_stack_and_queue/queue.md
index 229c6c94a..860b45fd9 100644
--- a/docs/chapter_stack_and_queue/queue.md
+++ b/docs/chapter_stack_and_queue/queue.md
@@ -428,13 +428,144 @@ comments: true
 === "JavaScript"
 
     ```js title="linkedlist_queue.js"
+    class LinkedListQueue {
+        #front;
+        #rear;  // 头结点 #front ，尾结点 #rear 
+        #queSize = 0;
+
+        constructor() {
+            this.#front = null;
+            this.#rear = null;
+        }
+
+        /* 获取队列的长度 */
+        get size() {
+            return this.#queSize;
+        }
+
+        /* 判断队列是否为空 */
+        isEmpty() {
+            return this.size === 0;
+        }
+
+        /* 入队 */
+        offer(num) {
+            // 尾结点后添加 num
+            const node = new ListNode(num);
+            // 如果队列为空，则令头、尾结点都指向该结点
+            if (!this.#front) {
+                this.#front = node;
+                this.#rear = node;
+                // 如果队列不为空，则将该结点添加到尾结点后
+            } else {
+                this.#rear.next = node;
+                this.#rear = node;
+            }
+            this.#queSize++;
+        }
 
+        /* 出队 */
+        poll() {
+            const num = this.peek();
+            if (!this.#front) {
+                throw new Error("No element in queue!")
+            }
+            // 删除头结点
+            this.#front = this.#front.next;
+            this.#queSize--;
+            return num;
+        }
+
+        /* 访问队首元素 */
+        peek() {
+            if (this.size === 0)
+                throw new Error("No element in queue!");
+            return this.#front.val;
+        }
+
+        /* 将链表转化为 Array 并返回 */
+        toArray() {
+            let node = this.#front;
+            const res = new Array(this.size);
+            for (let i = 0; i < res.length; i++) {
+                res[i] = node.val;
+                node = node.next;
+            }
+            return res;
+        }
+    }
     ```
 
 === "TypeScript"
 
     ```typescript title="linkedlist_queue.ts"
+    /* 基于链表实现的队列 */
+    class LinkedListQueue {
+        private front: ListNode | null;
+        private rear: ListNode | null;  // 头结点 front ，尾结点 rear 
+        private queSize: number = 0;
 
+        constructor() {
+            this.front = null;
+            this.rear = null;
+        }
+
+        /* 获取队列的长度 */
+        get size(): number {
+            return this.queSize;
+        }
+
+        /* 判断队列是否为空 */
+        isEmpty(): boolean {
+            return this.size === 0;
+        }
+
+        /* 入队 */
+        offer(num: number): void {
+            // 尾结点后添加 num
+            const node = new ListNode(num);
+            // 如果队列为空，则令头、尾结点都指向该结点
+            if (!this.front) {
+                this.front = node;
+                this.rear = node;
+                // 如果队列不为空，则将该结点添加到尾结点后
+            } else {
+                this.rear!.next = node;
+                this.rear = node;
+            }
+            this.queSize++;
+        }
+
+        /* 出队 */
+        poll(): number {
+            const num = this.peek();
+            if (!this.front) {
+                throw new Error("No element in queue!")
+            }
+            // 删除头结点
+            this.front = this.front.next;
+            this.queSize--;
+            return num;
+        }
+
+        /* 访问队首元素 */
+        peek(): number {
+            if (this.size === 0)
+                throw new Error("No element in queue!");
+            return this.front!.val;
+        }
+
+        /* 将链表转化为 Array 并返回 */
+        toArray(): number[] {
+            let node = this.front;
+            const res = new Array<number>(this.size);
+            for (let i = 0; i < res.length; i++) {
+                res[i] = node!.val;
+                node = node!.next;
+            }
+            return res;
+        }
+    }
     ```
 
 === "C"
@@ -718,13 +849,160 @@ comments: true
 === "JavaScript"
 
     ```js title="array_queue.js"
+    /* 基于环形数组实现的队列 */
+    class ArrayQueue {
+        queue;     // 用于存储队列元素的数组
+        front = 0;  // 头指针，指向队首
+        rear = 0;   // 尾指针，指向队尾 + 1
+        CAPACITY = 1e5;
+
+        constructor(capacity) {
+            this.queue = new Array(capacity ?? this.CAPACITY);
+        }
+
+        /* 获取队列的容量 */
+        get capacity() {
+            return this.queue.length;
+        }
+
+        /* 获取队列的长度 */
+        get size() {
+            // 由于将数组看作为环形，可能 rear < front ，因此需要取余数
+            return (this.capacity + this.rear - this.front) % this.capacity;
+        }
+
+        /* 判断队列是否为空 */
+        empty() {
+            return this.rear - this.front == 0;
+        }
+
+        /* 入队 */
+        offer(num) {
+            if (this.size == this.capacity) {
+                console.log("队列已满");
+                return;
+            }
+            // 尾结点后添加 num
+            this.queue[this.rear] = num;
+            // 尾指针向后移动一位，越过尾部后返回到数组头部
+            this.rear = (this.rear + 1) % this.capacity;
+        }
 
+        /* 出队 */
+        poll() {
+            const num = this.peek();
+            // 队头指针向后移动一位，若越过尾部则返回到数组头部
+            this.front = (this.front + 1) % this.capacity;
+            return num;
+        }
+
+        /* 访问队首元素 */
+        peek() {
+            // 删除头结点
+            if (this.empty())
+                throw new Error("The queue is empty!");
+            return this.queue[this.front];
+        }
+
+        /* 访问指定索引元素 */
+        get(index) {
+            if (index >= this.size)
+                throw new Error("Index out of bounds!");
+            return this.queue[(this.front + index) % this.capacity];
+        }
+
+        /* 返回 Array */
+        toArray() {
+            const siz = this.size;
+            const cap = this.capacity;
+            // 仅转换有效长度范围内的列表元素
+            const arr = new Array(siz);
+            for (let i = 0, j = this.front; i < siz; i++, j++) {
+                arr[i] = this.queue[j % cap];
+            }
+            return arr;
+        }
+    }
     ```
 
 === "TypeScript"
 
     ```typescript title="array_queue.ts"
 
+    /* 基于环形数组实现的队列 */
+    class ArrayQueue {
+        private queue: number[];     // 用于存储队列元素的数组
+        private front: number = 0;  // 头指针，指向队首
+        private rear: number = 0;   // 尾指针，指向队尾 + 1
+        private CAPACITY: number = 1e5;
+
+        constructor(capacity?: number) {
+            this.queue = new Array<number>(capacity ?? this.CAPACITY);
+        }
+
+        /* 获取队列的容量 */
+        get capacity(): number {
+            return this.queue.length;
+        }
+
+        /* 获取队列的长度 */
+        get size(): number {
+            // 由于将数组看作为环形，可能 rear < front ，因此需要取余数
+            return (this.capacity + this.rear - this.front) % this.capacity;
+        }
+
+        /* 判断队列是否为空 */
+        empty(): boolean {
+            return this.rear - this.front == 0;
+        }
+
+        /* 入队 */
+        offer(num: number): void {
+            if (this.size == this.capacity) {
+                console.log("队列已满");
+                return;
+            }
+            // 尾结点后添加 num
+            this.queue[this.rear] = num;
+            // 尾指针向后移动一位，越过尾部后返回到数组头部
+            this.rear = (this.rear + 1) % this.capacity;
+        }
+
+        /* 出队 */
+        poll(): number {
+            const num = this.peek();
+            // 队头指针向后移动一位，若越过尾部则返回到数组头部
+            this.front = (this.front + 1) % this.capacity;
+            return num;
+        }
+
+        /* 访问队首元素 */
+        peek(): number {
+            // 删除头结点
+            if (this.empty())
+                throw new Error("The queue is empty!");
+            return this.queue[this.front];
+        }
+
+        /* 访问指定索引元素 */
+        get(index: number): number {
+            if (index >= this.size)
+                throw new Error("Index out of bounds!");
+            return this.queue[(this.front + index) % this.capacity];
+        }
+
+        /* 返回 Array */
+        toArray(): number[] {
+            const siz = this.size;
+            const cap = this.capacity;
+            // 仅转换有效长度范围内的列表元素
+            const arr = new Array(siz);
+            for (let i = 0, j = this.front; i < siz; i++, j++) {
+                arr[i] = this.queue[j % cap];
+            }
+            return arr;
+        }
+    }
     ```
 
 === "C"