In this tutorial, we’ll learn about Basic Linked List Operations which will be used throughout your programming career.

These Basic Linked List Operations include from basic to advance operations.

- Creating a Linked List.
- Transversing the Linked List.
- Printing the Link List.
- Counting the nodes in the Linked List.
- Searching an item in the Linked List.
- Inserting an item.
- Deleting an item.
- Concatenation two lists.
- Inversion.
- Sorting of elements stored in a linked list.
- Merging of two Sorted Link list.
- Separating a linked list into two linked lists.

Datatype for linked list as an ADT (Abstract Data Type)

```
{
int data;
strut node * next;
} node;
```

**Note: **Data above is assumed to be of integer type.

Below are Operations on the Linked List

- Create
- Delete
- Insert
- Make null
- Search
- Sort

Prototype of functions used for various operations

```
node * create();
node * delete (node * head, int location);
node * insert (node * head, int data, int location)
node * make *** (node * head);
node * search (node * head, int data);
void print (node * head);
void sort (node * head);
```

Data Structures Algorithms Books: Algorithms Plus Data Structures

Ask your questions and clarify your/others doubts on Basic Linked List Operations by commenting or posting on our forum.

PREVIOUSCIRCULAR LINKED LIST | NEXTCOMING SOON |