Stacks and Queues

Stacks

A collection of elements following the Last In, First Out (LIFO) principle.

Queues

A collection of elements following the First In, First Out (FIFO) principle.

Push

Operation that adds an element to the top of the stack.

Pop

Operation that removes the topmost element from the stack and returns it.

Peek (Top)

Operation that returns the topmost element of the stack without removing it.

Is Empty?

Determines whether the stack does not contain any elements.

Is Full?

Determines if the stack has reached its capacity.

Abstract Data Types (ADT)

A conceptual model focusing on describing operations, regardless of underlying implementation.

Enqueue

Operation that adds an element to the end of the queue.

Dequeue

Operation that removes the first element from the queue and returns it.

Peek (Front)

Operation that returns the first element of the queue without removing it.

Linked List Implementation

A way to implement stacks and queues where each element is a node in a linked list.

Array Implementation

A way to implement stacks and queues using an array, requiring a specified size.

Running Time Complexity

A measure of the time an algorithm takes to complete based on the size of the input.

Circular Arrays

A method of using a fixed-size array to implement a queue, allowing for efficient reuse of space.

LIFO

Last In, First Out; describes the order in stacks.

FIFO

First In, First Out; describes the order in queues.

Capacity

The maximum number of elements that a stack or queue can hold.