he following are the operations that you can do using a single linked list. Choose only one operation then create the algorithm and simulate. The attached Rubric will be used in evaluating the activity. 1. Delete a particular node in a single linked list 2. Delete the first node of a single linked list 3. Insertion after a given node of a single linked list 4. Insertion at a given position in a single linked list 5. Insertion before a given node in a single linked list 6. Reverse a single linked list EX: Delete the last node of a single linked list
The following are the operations that you can do using a single linked list. Choose only one operation then create the
1. Delete a particular node in a single linked list
2. Delete the first node of a single linked list
3. Insertion after a given node of a single linked list
4. Insertion at a given position in a single linked list
5. Insertion before a given node in a single linked list
6. Reverse a single linked list
EX: Delete the last node of a single linked list
Problem" Deletion of the last node in a single linked list
Algorithm"
Step 1: if HEAD = NULL
Write UNDERFLOW
Go to Step 8
Step 2: SET PTR = HEAD
Step 3: Repeat Steps 4 and while PTR à NEXT = NULL
Step 4: SET PREPPTR = PTR
Step 5: SET PTR =PTR à NEXT
[End of loop]
Step 6: SET PREPTR à NEXT = NULL
Step 7: FREE PTR
Step 8: EXIT
SIMULATION"
Step 1: Start PTR = HEAD
Step 2: While ( PTR à next ! = NULL )
PTR 1 = PTR;
PTR = PTR à next;
Step 3: PTR1 à next = NULL;
Free ( PTR );
Step 4: printf ( " delete node from the last')
Step 5: END
Step by step
Solved in 3 steps
