Python code HW

1. swap two nodes x and y (and not just their contents) in a singly linked list L given references only to x and y. Repeat this exercise for the case when L is a doubly linked list. Which algorithm takes more time?

2. Give a fast algorithm for concatenating two doubly linked lists L and M, with header and trailer sentinel nodes, into a single listL?.