1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
DELETING FROM THE END OF THE LIST
To delete anelement from the end of the list, we first traverse to the second last
element of the list and follow the given below algorithm
Algorithm
Deleting (START).This algorithm deletes an element from the last position of the
linked list.
1. [Check for underflow ?]
if start = NULL , then
print, ‘Linked list empty’
Exit
End if
2. If start next = NULL, then
Set PTR=start
Set start = NULL
Print, element deleted is = PTR INFO
Free(PTR)
END if
3.Set PTR =START
4. Repeat steps 5 and 6 will PTNext!=NULL
5. Set LOC = PTR
6. Set PTR = PTNext
7. Set LOCnext = NULL
8.Free( PTR)
DELETION AFTER A GIVEN ELEMENT OF THE LIST
To delete an element after a given element, first we find the location(say loc) of
the element after which the element to be deleted comes.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 110 ‐