1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
node are both NULL, indicating the end of the list for each direction.
Same as the linear linked list, the basic operations of double linked list include
insertion, deletion and search. We will discuss them in the following section.
To create an ADT for two‐way linked lists the following operations (at a
minimum) are needed:
• Create: Start a new list with nothing in it.
• Insert: Add a record to the list.
• Delete: Delete a record from the list.
• Get Info: Find and return information from a record in the list.
These operations basically mimic the simple linked list case, except that
additional access variables must be used.
OPERATIONS:
Insertion of Double Linked List:
Insertion is to add a new node into a linked list. It can take place anywhere ‐‐
the first, last, or interior of the linked list.
To add a new node to the head and tail of a double linked list is similiar to the
linear linked list. First, we need to construct a new node that is pointed by
pointer new. Then the new node is linked to the left‐most node (or right‐most
node) in the list. Finally, the Left (or Right) is set to point to the new node.
To add a new node inside a double linked list is much more complicated. Four
links must be attached. The following example will give you the details
Example: Insert a new node to the left of a node pointed by cur in a double
linked list.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 114 ‐