rearrange(head); printList(head); return0; } DownloadRun Code Output: 1—> 3 —> 5 —> 2 —> 4 —> null The time complexity of the above solution isO(n), wherenis the total number of nodes in the linked list, and doesn’t require any extra space. Also See: Rearrange linked li...