How will you implement merge sort on LinkedList.
The algorithm works as :
Time complexity :- \( O(nlogn) \). Space complexity :- \( O(1) \) (This is an improvement over merge sort in array which is \( O(n) \)). public node mergeSort (node list1){ |