What does the following routine do on doubly linked list. M is some middle node address and N is a newly inserted node address.
N → lptr = M ;
N → rtptr = M → rptr ;
N → lptr → rptr = N ;
N → rptr → lptr = N ;
Inserts a node to1
Right of M
2
Left of M
3
Right Most
4
Left Most