node-data-structure • Docs
node-data-structure / index / Stack
Represents a stack implemented using a linked list.
A node contains a value and a reference to the next node in the list.
• T
The type of value stored in the node.
new Stack<
T
>():Stack
<T
>
Stack
<T
>
clear():
void
Removes all elements from the stack.
This method clears the stack, resetting its size to zero
void
const stack = new Stack<number>()
stack.push(10)
stack.push(20)
console.log(stack.size()) // Outputs: 2
stack.clear()
console.log(stack.size()) // Outputs: 0
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 stack = new Stack<number>()
console.log(stack.isEmpty()) // Outputs: true
stack.push(10)
stack.push(20)
console.log(stack.isEmpty()) // Outputs: false
stack.clear()
console.log(stack.isEmpty()) // Outputs: true
peek():
null
|T
Returns the top element of the stack without removing it.
null
| T
The element at the top of the stack, or null
if the stack is empty.
const stack = new LinkedListStack<number>();
stack.push(10);
stack.push(20);
console.log(stack.peek()); // Outputs: 20
pop():
null
|T
Removes and returns the top element of the stack.
null
| T
The element removed from the top of the stack, or null if the stack is empty
const stack = new LinkedListStack<number>();
stack.push(10);
console.log(stack.pop()); // Outputs: 10
console.log(stack.pop()); // Outputs: undefined
push(
item
):void
Pushed a new element onto the top of the stack
• item: T
The element to push onto the stack
void
size():
number
Returns the number of elements in the stack.
number
The number of elements in the stack.
const stack = new Queue<number>()
stack.push(10)
stack.push(20)
console.log(stack.size()) // Outputs: 2