import Stack from 'algorithmsjs/src/stack/Stack.js'

public class | source

Stack

Stack: LIFO data structure Usage: let stack = new Stack(); stack.push('A'); stack.push('B'); stack.pop(); => B'

Constructor Summary

Public Constructor
public	constructor

Public Methods
public	clear(): void Clears out all items from the Stack.
public	count(): Number Gets number of items currently on the stack.
public	isEmpty(): Boolean Returns boolean value based on contents of stack.
public	pop(): <Item> returns last value pushed onto Stack; modifies Stack items in-place
public	print(): String
public	push(value: item): void Appends an item to the top of the Stack.

Clears out all items from the Stack.

void

Gets number of items currently on the stack.

Returns boolean value based on contents of stack.

true if Stack is empty, otherwise false.

returns last value pushed onto Stack; modifies Stack items in-place

<Item>

last value pushed onto Stack.

if stack is empty.

string representation of the Stack structure

Appends an item to the top of the Stack.

Name	Type	Attribute	Description
value	item		to push onto the top of the Stack

void