Pseudo Code

 1.<Functions for Single Linked Lists>
 2.function insertAtBeginning(value):
 3.  newNode = Node(value)
 4.  newNode.next = head
 5.  head = newNode
 6.end procedure
 7.
 8.function insertAtEnd(value):
 9.  newNode = Node(value)
10.  if head == null:
11.    head = newNode
12.  else:
13.    traverse to last node
14.    lastNode.next = newNode
15.end procedure
16.
17.function insertAtIndex(index, value):
18.  if index == 0:
19.    insertAtBeginning(value)
20.  else:
21.    traverse to (index-1)th node
22.    newNode = Node(value)
23.    newNode.next = prev.next
24.    prev.next = newNode
25.end procedure
26.
27.function deleteFromBeginning():
28.  if head != null:
29.    head = head.next
30.end procedure
31.
32.function deleteFromEnd():
33.  if head == null:
34.    return
35.  if head.next == null:
36.    head = null
37.  else:
38.    traverse to second last node
39.    secondLast.next = null
40.end procedure
41.
42.function deleteAtIndex(index):
43.  if index == 0:
44.    deleteFromBeginning()
45.  else:
46.    traverse to (index-1)th node
47.    prev.next = prev.next.next
48.end procedure

Explanation

Singly Linked List

A singly linked list is a linear data structure where each node contains a value and a pointer to the next node. Traversal is only possible in one direction — from head to tail. The last node points to null.

Time Complexity

O(1) insert/delete at head, O(n) at index/tail

Space Complexity

O(n)

Key Operations

•Insert at start: Create node, point it to head, update head
•Insert at end: Traverse to tail, link new node
•Insert at index: Traverse to (index-1), splice in new node
•Delete at start: Move head to head.next
•Delete at end: Traverse to second-last, set next to null
•Delete at index: Traverse to (index-1), skip target node

Linked List

Pseudo Code

Visualisation— Singly Linked List

Explanation