Write a function named“removeNode” that takes a head of the linked list ofstruct Student and a student name (String). The function removes the node that has the student name.
Assume the following declaration and how the function is called:
struct Student {
String name;
int score;
Student *next;
};
void removeNode (Student *firstStudent, String studentName);
int main()
{
Student *firstStudent; // address of the head
// Assuming some code to fill in all data
//
Student *newStudent = new Student;
// fill in data for newStudent
insertNode(firstStudent, newStudent);
return 0;
}
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here