Give a pseudo-code for a recursive node delete in the SLList::recDelete(int key), where key is the integer value of the node to be deleted. Here is a simple .h file for the SLList to use:

class SLLNode( public: SLLNode () [ next 0 ; SLLNode (int el, LLNode *ptr - data = el; next = ptr; int data; SLLNode *next; class SLList public: SLList) head = tail = 0 SLList (); int isEmpty (); void addToHead (int); void addToTail(int); int deleteFromHead (); int deleteFromTail (); //delete n de with data = int void deleteNode (int) ; void printAll () const void shuffleList(); private SLLNode *head, *tail