Linked List Merge Sort

#1
  1. node* mid=midPoint(head);
  2. node* a=head;
  3. node* b=mid->next;
    In 2 line head must be targetting all nodes ??
#2

hello @ashwani225
after line 3.
it should be
mid->next=NULL;

so after doing this ur node will not be targeting all the nodes .
it will head of the list from head to node just before b.

#3

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.