1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
Two_Way_Linked_List T;
head
In the linear linked list, we can only traverse the linked list in one direction. But
sometimes, it is very desirable to traverse a linked list in either a forward or
reverse manner. This property of a linked list implies that each node must
contain two link fields instead of one. The links are used to denote the
predecessor and successor of a node. The link denoting the predecessor of a
node is called the left link, and that denoting its successor its right link. The
Figure 3.1‐01 shows the structure of the node.
A list containing this type of node is called a doubly linked linear list. See Figure
3.1‐02.
Left and Right are pointer variables denoting the left‐most and right‐most nodes
in the list. The left link of the left‐most node and the right link of the right‐most
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 113 ‐