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.
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 value 10, and because the value of the first node is greater than 10 so we insert 10 before the value 20.
after that we insert the value 30 and because the 30 is greater than 20 so we insert it at last.
after that, we insert values 15 and 15 is greater than 10 but less than 20 so we insert 15 in between the values 10 and 20.
after that, we insert value 35, and 35 is greater than 30 so we insert it in last.
at last, we insert value 5, and because the value 5 is less than 10 so we insert it before the node that has value 10.
so this is the sorted linked list because the linked list is sorted in an order.
