linked list operations in data structures

In detail operations in linked list has been shared here

1. தரவகடடடமமபடப
|
இமணகடகபடபடடட

வரரமசயரனடதரவகமளஉளடளளடமடமமறகளட

பப.மககலடடசமர

Data Structures |
Linked List

2. Data Structures -
Linked List insertion
operations
Mahalakshmi P

3. Insert node at the beginning of Singly
Linked List
●Steps to insert a new node at the start of a singly
linked list.

4. Create a new node, say newNode points to the newly
created node.

5. Link the newly created node with the head node, i.e.
the newNode will now point to head node.

6. Make the new node as the head node, i.e. now head
node will point to newNode.

7. Insert node at the end of Singly
Linked List

8. Steps to insert node at the end of Singly
linked list

9. ●Create a new node and make sure that the address
part of the new node points to NULL i.e. newNode-
>next=NULL

10. ●Traverse to the last node of the linked list and connect
the last node of the list with the new node, i.e. last
node will now point to new node. (lastNode->next =
newNode).

11. Insert node at the middle of Singly
Linked List

12. ●Steps to insert node at the middle of Singly Linked
List

13. ●Create a new node.

14. ●Traverse to the n-1th position of the linked list and
connect the new node with the n+1th node. Means the
new node should also point to the same node that the
n-1th node is pointing to. (newNode->next = temp-
>next where temp is the n-1th node).

15. ●Now at last connect the n-1th node with the new node
i.e. the n-1th node will now point to new node. (temp-
>next = newNode where temp is the n-1th node).

16. Reference
●https://codeforwin.org/2015/09/c-program-to-insert-n
ode-at-middle-of-singly-linked-list.html
●http://btechsmartclass.com/data_structures/single-
linked-list.html