Singly Linked List Operations

SINGLE LINKED LIST PROGRAM ARCHITECTURE

Singly Linked List Operations

Definition of single linked list

Creating single linked list

Traversing through singly linked list (sll)

Display elements from first to last

Display elements from last to first

Counting no of nodes in the Singly Linked List (SLL)

Searching particular node in single Linked List

Searching the data in the single linked list

Insertion node at front single linked list

Insertion new node at the end of the Linked List

Insertion element at middle of the linked list

Deletion of the first node

Delete middle node, 1st node or last node

Deletion of the last node
Deleting the linked list (all the nodes)

Concatenating two sll

Reversing single Linked list

Sorting of sll

Merging two sorted sll

Separating two Linked lists

Splitting two linked list at the middle

Removing duplicating elements from sll

Copying from one linked list to another linked list
Single Linked List program with all the operations

What is  Linked list
What is Single Linked List
Node class members or node structures
 Some terminology of Linked List programs

projects on single linked list