Sorted Linked List Data Structure | DSA Tutorials

Sorted Linked List – In Data Structure, A sorted linked list is a list that has been sorted in order while implementing it. Let’s take an example to understand it.

Sorted Linked List

Let’s say we have an empty linked list.

First, we insert the value 20 because the linked list is empty, so we insert 20 as the first value.

After that, we insert the value 10, and because the value of the first node is greater than 10, we insert 10 before the value 20.

After that, we insert the value 30, and because 30 is greater than 20, we insert it last.

After that, we insert the value 15 and 15 is greater than 10 but less than 20, so we insert 15 between the values 10 and 20.

After that, we insert the value 35, and 35 is greater than 30, so we insert it last.

At last, we insert value 5, and because value 5 is less than 10, we insert it before the node that has value 10.

So this is the sorted linked list because the linked list is sorted in order.