1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
In this structure link field of the last node points the head address of the list and
we obtain a circular linked list structure. In a circular list the next field in the last
node contains a pointer back to the first node rather than the null pointer. From
any point in such a list it is possible to reach any other point in the list.
Note that a circular list does not have a natural “first” or “last” node. We
therefore, establish a first and last node by convention. One useful convention
is to let the external pointer to the circular list point to the last node, and to
allow the following node to be the first node
Doubly Linked list Structure.
In this kind of linked list structure each node has two link(pointer) fields, Right
pointer and left pointer. We mostly use this kind of structure for
ordered(sorted) list structure. So it becomes so easy to obtain ascending and
descending order of information. In this structure there are two head nodes.
Which are the beginning points of Left head and Right head.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 104 ‐