class node public : int data; Node * next; };

write code plz

c++

head a) Move the node in between the nodes pointed to by A and (the node with value of the list: to the end b) Insert the node pointed to by N (with value 45) after the node A points to (node with value 3): c) Move the node pointed to by A (node with value 3) to be the Head (move it to the beginning of the list): d) Make pointer A point to the end of the list (don't move the node, just update A)