The document outlines algorithms for stack and queue operations using linked lists. It details the push and pop operations for stacks, including steps for creating a new node and handling empty stack cases. It also addresses adding and removing elements in a queue implemented with linked lists.

1. STACK USING LINKED LIST
PUSH
30

2. STACK USING LINKED LIST
POP
31

3. STACK USING LINKED LIST
ALGORITHM FOR PUSH OPERATION
1. Input the VALUE to be pushed
2. Creat a New Node
3. NewNode → DATA = VALUE
4. NewNode → Next = TOP
5. TOP = NewNode
6. Exit
32

4. STACK USING LINKED LIST
• ALGORITHM FOR POP OPERATION
1. if (TOP is equal to NULL)
Display "The stack is
empty"
2. Else
(a) TEMP = TOP
(b) Display "The popped
element TOP → DATA"
(c) TOP = TOP → Next
(d) Free the TEMP node
3. Exit
33

5. 34
QUEUE USING LINKED LIST
ADD to queue

6. QUEUE USING LINKED LIST
REMOVE from queue
35