Insertion Sort using LL

how to move in the backword directions ?

@Vikaspal hey you dont have to move backward,just assume first node is sorted and after that insert node in sorted order starting from first node of linked list.

@rishabhmahajan546 ok got it

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.