1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
DELETION OPRERATION
TO delete an element from the list, first the pointers are set properly and then
the memory occupied by the node to be deleted is deallocated(freed).
The deletion in the list can take place at the following positions:
at the beginning of the list.
at the end of the list
after a given element
Deletion has two steps:
1. Find the record preceding the one to be deleted from the list
2. Do the deletion
DELETING FROM THE BEGINNING OF THE LIST
An element from the beginning of the list can be deleted by following the given
below algorithm
Algorithm
Delete First (START). This algorithm Deletes an elements from the first position
or frent of the linked list.
1. [check for under flow ?]
If START = NULL, THEN
Print ‘Linked list empty’
Exit
End if
2. Set PTR = START
3. Set START = STARnext
4. Print, element deleted is, praInfo.
5. free(ptr).
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 109 ‐