![10
Operator new and delete
⚫Operators new allocate memory space.
◦ Operators new [ ] allocatesmemory space for array.
⚫Operators delete deallocate memory space.
◦ Operators delete[ ] deallocatememory space for array.](https://image.slidesharecdn.com/list-240327160246-b9a53737/85/data-structures-lists-operation-of-lists-10-320.jpg)
![11
Traversing a linked list:
⚫ Traversing is the process of accessing each node of the linked list
exactly once to perform some operation.
⚫ ALGORITHM: TRAVERS (START, P) START contains
the address of the first node.Another pointer p is temporarily used to
visit all the nodes from the beginning to the end of the linked list.
Step 1: P = START
Step 2: while P != NULL
Step 3:
Step 4:
PROCESS data (P)
P = link(P)
[Fetch the data]
[Advance P to next node]
Step 5: End of while
Step 6: Return](https://image.slidesharecdn.com/list-240327160246-b9a53737/85/data-structures-lists-operation-of-lists-11-320.jpg)
![16
Inserting node at Last
⚫ ALGORITHM: INS_END (START, P) START contains
the address of the first node.
Step 1: START
Step 2: P START [identify the last node]
while P!= null
P next (P)
End while
Step 3: N new Node;
Step 4: data(N) item;
Step 5: link(N) null
Step 6: link(P) N
Step 7: Return Prof. K. Adisesha 75](https://image.slidesharecdn.com/list-240327160246-b9a53737/85/data-structures-lists-operation-of-lists-16-320.jpg)
![17
Inserting node at a given Position
count+1
next (P)
Count 0
Step 3: while P!= null
count
P
End while
Step 4: if (POS=1)
Call function INS_BEG( )
else if (POS=Count +1)
Call function INS_END( )
For(i=1; i<=pos; i++)
P next(P);
end for
new node
item;
link(P)
N
[create] N
data(N)
link(N)
link(P)
else
PRINT “Invalid position”
Step 5: Return
ALGORITHM: INS_POS (START, P) START contains the
address of the first node.
Step 1: START else if (POS<=Count)
Step 2: P START [Initialize node] P Start](https://image.slidesharecdn.com/list-240327160246-b9a53737/85/data-structures-lists-operation-of-lists-17-320.jpg)
data structures lists operation of lists
- 1. Lists By Muskan. S (Embedded System and VLSI)
- 2. 2 Lists ⚫ Alists (Linear linked list) can be defined as a collection of variable number of data items called nodes. ⚫ Lists are the most commonly used non- primitive data structures. ⚫ Each nodes is divided into two parts: ◦ The first part contains the information of the element. ◦ o The second part contains the memory address of the next node in the list.Also called Link part.
- 3. 3 Lists ⚫Types of linked lists: ◦ Single linked list ◦ Doubly linked list ◦ Single circular linked list ◦ Doubly circular linked list
- 4. 4 Single linked list Asingly linked list contains two fields in each node - an information field and the linked field. •The information field contains the data of that node. •The link field contains the memory address of the next node. There is only one link field in each node, the linked list is called singly linked list.
- 5. 5 Single circular linked list The link field of the last node contains the memory address of the first node, such a linked list is called circular linked list. · In a circular linked list every node is accessible from a given node.
- 6. 6 Doubly linked list It is a linked list in which each node is points both to the next node and also to the previous node. ⚫ In doubly linked list each node contains three parts: ◦ FORW : It is a pointer field that contains the address of the next node ◦ BACK: It is a pointer field that contains the address of the previous node. ◦ INFO: It contains the actual data. ⚫ In the first node, if BACK contains NULL, it indicated that it is the first node in the list. ⚫ The node in which FORW contains, NULL indicates that the node is the last node.
- 7. 7 Doubly circular linked list
- 8. 8 Operation on Linked List ⚫The operation that are performed on linked lists are: ◦ Creating a linked list ◦ Traversing a linked list ◦ Inserting an item into a linked list. ◦ Deleting an item from the linked list. ◦ Searching an item in the linked list ◦ Merging two or more linked lists.
- 9. 9 Creating a linked list ⚫ The nodes of a linked list can be created by the following structure declaration. struct Node { int info; struct Node *link; }*node1, node2; ⚫ Here info is the information field and link is the link field. ⚫ The link field contains a pointer variable that refers the same node structure. Such a reference is called as Self addressing pointer.
- 10. 10 Operator new and delete ⚫Operators new allocate memory space. ◦ Operators new [ ] allocatesmemory space for array. ⚫Operators delete deallocate memory space. ◦ Operators delete[ ] deallocatememory space for array.
- 11. 11 Traversing a linked list: ⚫ Traversing is the process of accessing each node of the linked list exactly once to perform some operation. ⚫ ALGORITHM: TRAVERS (START, P) START contains the address of the first node.Another pointer p is temporarily used to visit all the nodes from the beginning to the end of the linked list. Step 1: P = START Step 2: while P != NULL Step 3: Step 4: PROCESS data (P) P = link(P) [Fetch the data] [Advance P to next node] Step 5: End of while Step 6: Return
- 12. 12 Inserting a node into the linked list ⚫Inserting a node at the beginning of the linked list ⚫Inserting a node at the given position. ⚫Inserting a node at the end of the linked list.
- 13. 13 Inserting node at Front Inserting a node at the beginning of the linked list 1. Create a node. 2. Fill data into the data field of the new node. 3. Mark its pointer field as NULL 4. Attach this newly created node to START 5. Make the new node as the START node.
- 14. 14 Inserting node at Front ⚫ALGORITHM: INS_BEG (START, P) START contains the address of the first node. Step 1: P new Node; num; START P Step 2: data(P) Step 3: link(P) Step 4: START Step 5: Return
- 15. 15 Inserting node at Last
- 16. 16 Inserting node at Last ⚫ ALGORITHM: INS_END (START, P) START contains the address of the first node. Step 1: START Step 2: P START [identify the last node] while P!= null P next (P) End while Step 3: N new Node; Step 4: data(N) item; Step 5: link(N) null Step 6: link(P) N Step 7: Return Prof. K. Adisesha 75
- 17. 17 Inserting node at a given Position count+1 next (P) Count 0 Step 3: while P!= null count P End while Step 4: if (POS=1) Call function INS_BEG( ) else if (POS=Count +1) Call function INS_END( ) For(i=1; i<=pos; i++) P next(P); end for new node item; link(P) N [create] N data(N) link(N) link(P) else PRINT “Invalid position” Step 5: Return ALGORITHM: INS_POS (START, P) START contains the address of the first node. Step 1: START else if (POS<=Count) Step 2: P START [Initialize node] P Start
- 18. 18 Deleting an node ⚫Deleting an item from the linked list: o Deletion of the first node o Deletion of the last node o Deletion of the node at the give position
- 19. 19 Deleting node from end ALGORITHM: DEL_END (P1, P2, START) This used two pointers P1 and P2. Pointer P2 is used to traverse the linked list and pointer P1 keeps the location of the previous node of P2. Step 1: START Step 2: P2 START; Step 3: while ( link(P2) ! = NULL) P1 P2 P2 link(P2) While end Step 4: PRINT data(p2) NULL Step 5: link(P1) Free(P2) Step 6: STOP
- 20. 20 Deleting node from end
- 21. THANK YOU