remove all the occurrences of 2's from the linked list recursively //****************************************** list.h************************** struct node { int data; node * next; }; class list { public: //These functions are already written for you list(); //supplied ~list(); //supplied void build(); //supplied void display(); //supplied /* *****************YOUR TURN! ******************************** */ //Write your function prototype here: int removeTwo(); int removeTwo( node *& head); private: //notice there is both a head and a tail! node * head; node * tail; };

what i have:

int removeTwo()

{

if (head == NULL) return 0;

removeTwo(head);

}

int removeTwo(node *& head)

{ node * t = head;

if(t->data == 2)

{ head = head->next; delete t; removeTwo(head) }

removeTwo(head->next); }

this function works, except if the list has a 2 at the end. then it seg faults. please help!!