1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
1) Assign currentNode to previousNode
2) Assign nextNode to currentNode
3) Assign currentNodenext to nextNode
4) Assign previousNode to currentNode
These steps are repeated, till the last element becomes the current element.
At this point , assign the address of the last element , held in variable
currentNode, to head variable.
Two‐way (Doubly) Linked Lists
Two‐way linked lists make it easier to move backward (in addition to forward)
in the list.
Two‐way linked lists usually have a dummy node (called Head), with head and
tail pointers already built‐in to the structure.
The empty list looks like:
Two_Way_Linked_List T;
head
data1 data2 data3
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 112 ‐