Reading-Notes

Class 10 Summary :

Stacks and Queues :

What is a Stack ?

• “is a data structure that consists of nodes. each node references the next node in the stack, but does not reference its previous.

Stack Terminology :

1. Push .
2. Pop.
3. Top.
4. Peek.
5. IsEmpty.

Stacks Concepts :

1. FILO ( First In Last Out)
2. LIFO (Last In First Out)

Stack Visualization :

What is a Queue ?

• “a queue is a collection of entities that are maintained in a sequence and can be modified by the addition of entities at one end of the sequence and the removal of entities from the other end of the sequence”.

Queue Terminology :

1. Enqueue.
2. Dequeue.
3. Front.
4. Rear.
5. Peek.
6. IsEmpty

Queue concepts :

1. FIFO (First In First Out)
2. LILO (Last In Last Out)

Queue Visualization :

Sources :

source1

source2