Given the head of a linked list, swap every two adjacent nodes and return the new head. Swap the nodes themselves, not just their values. A trailing odd node stays in place.