node-data-structure • Docs
node-data-structure / index / Queue
Represents a Queue data structure using a linked list
• T
The type of elements stored in the queue.
new Queue<
T
>():Queue
<T
>
Queue
<T
>
clear():
void
Removes all elements from the queue.
This method clears the queue, removing all elements and resetting its size to zero
void
dequeue():
null
|T
Dequeues the element at the front of the queue.
null
| T
The element removed from the front of the queue, or null
if the queue is empty.
const queue = new Queue<number>()
queue.enqueue(10)
queue.enqueue(20)
console.log(queue.dequeue()) // Outputs: 10
console.log(queue.dequeue()) // Outputs: 20
console.log(queue.dequeue()) // Outputs: null
enqueue(
item
):void
Enqueue a new element at the end of the queue
• item: T
The Element to add to the queue.
const queue = new Queue<number>()
queue.enqueue(10)
queue.enqueue(20)
console.log(queue.size()) // Outputs: 2
void
getList():
LinkedList
<T
>
LinkedList
<T
>
isEmpty():
boolean
Checks whether the queue is empty.
boolean
true
if the queue is empty, or false
if it contains elements.
const queue = new Queue<number>();
console.log(queue.isEmpty()); // Outputs: true
queue.enqueue(10);
console.log(queue.isEmpty()); // Outputs: false
#### Defined in
[queue/queue.ts:105](https://github.com/jun-young1993/data-structure/blob/aceac108cb0dab76587bb5b0477739cbebe8772b/src/queue/queue.ts#L105)
***
### peek()
> **peek**(): `null` \| `T`
Returns the element at the front of the queue without removing it.
#### Returns
`null` \| `T`
#### Example
```typescript
const queue = new Queue<number>();
queue.enqueue(10);
queue.enqueue(20);
console.log(queue.peek()); // Outputs: 10
console.log(queue.size()); // Outputs: 2
size():
number
Returns the number of elements in the queue.
number
The number of elements in the queue.
const queue = new Queue<number>();
queue.enqueue(10);
queue.enqueue(20);
console.log(queue.size()); // Outputs: 2