![Deletion from beginning
Before deletion
Start =
link[12]
Deleting
9
Start = link[ 12 ]
9
12 1004 99 1014 37](https://image.slidesharecdn.com/insertionintolinkedlists-120814223713-phpapp01/85/Insertion-into-linked-lists-4-320.jpg)
![Deletion from end
Before deletion
Start =
link[12]
Deleting
Start = link[12]
12 1004 99 1014 37](https://image.slidesharecdn.com/insertionintolinkedlists-120814223713-phpapp01/85/Insertion-into-linked-lists-5-320.jpg)
![Deletion from kth position
Before deletion
Start = link[12]
12 1004 99 1014 45 1045 37
1004 1014 1045
Deleting from 3rd position
Start = link[12] Searching element
Element found
12 1004 99 1014 45 1045 37
1004 1014 1045](https://image.slidesharecdn.com/insertionintolinkedlists-120814223713-phpapp01/85/Insertion-into-linked-lists-6-320.jpg)
Insertion into linked lists
- 2. Deletion from linked list 1) Deletion from beginning deleting the node from the first position 2) Deletion from end deleting the node from the last position 3) Deletion from kth position deleting the node from a particular position
- 3. Deletion from linked list There are a few steps to delete a node from a link list Find the node. Store the link of node in a variable. Remove that node. Reconnect the linked list. Update the link to the beginning (if necessary). Deletion could not be done If the link list is empty
- 4. Deletion from beginning Before deletion Start = link[12] Deleting 9 Start = link[ 12 ] 9 12 1004 99 1014 37
- 5. Deletion from end Before deletion Start = link[12] Deleting Start = link[12] 12 1004 99 1014 37
- 6. Deletion from kth position Before deletion Start = link[12] 12 1004 99 1014 45 1045 37 1004 1014 1045 Deleting from 3rd position Start = link[12] Searching element Element found 12 1004 99 1014 45 1045 37 1004 1014 1045
- 8. Introduction Linked list is one of the fundamental data structures, and can be used to implement other data structures. In a linked list there are different numbers of nodes. Each node is consists of two fields. The first field holds the value or data and the second field holds the reference to the next node or null if the linked list is empty. Example:-
- 9. Adding An Element to a Linked List Involves two steps: Finding the correct location. Doing the work to add the node. Finding the Correct Location:- Three possible positions:- The front. Somewhere in the middle. The end.
- 10. Three Types of Insertion To front No recursion needed. In order (in middle) To maintain sorted property. To end Get to the end, then add node.
- 11. 5 Inserting to the Front Start 10 20 30 40 Explain:- There is no work to find the correct location Empty or not, head will point to the right location
- 12. Inserting to the Middle 25 Start 5 10 20 30 Null Null Used when order is important Go to the node that should follow the one to add
- 13. Inserting to the End 40 Start 5 10 20 //30 Null Null Find the end of the list (when at NIL).
- 14. The Work to Add the Node Create the new node Fill in the data field Deal with the next field Point to nil (if inserting to end) Point to current (front or middle) temp <- new(Node) temp^.data <- new_data temp^.next <- current current <- temp