1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
INSERTING AT THE BEGINNING OF THE LIST
To insert an element at the beginning of the list,first we test whether the linked
list is initially empty .If yes, then the element is inserted as the first and only
element of the list
However, if the list is initially not empty, then the element is inserted as the
first element of the list
Algorithm
INSERT_FIRST(START ITEM).This algo insert an item as the first Node of the
Linked list pointed by start
1. [check for overflow ?]
if PTR=NULL, then
print,overflow
exit
else
PTR=(Node *) malloc(size of (node)).
//Create new node from memory and assign its
address to PTR
End if
2. Set PTR INFO=item
3. Set PTRNEXT=START
4. Set START=PTR
INSERTING A NODE AT THE END
To insert the element at the end of the list, first we test whether the linked list
is initially empty.If yes, then the element is inserted as the first and and only
element of the list
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 106 ‐