5. Given a doubly linked list of sorted in descending order integers, write a routine that...

   

Transcribed Image Text:

5. Given a doubly linked list of sorted in descending order integers, write a routine that takes as an argument the head of the list and an integer x, and will remove ALL of the occurrences of integer x from the doubly linked list. The resulting list after the deletions should also be sorted in descending order. (10 points) For reference a node is declared as follows: typedef struct node *nodeptr; struct node { int value; nodeptr next; nodeptr prev; } here is how the head ptr was declared: nodeptr head; here is the function prototype for DeleteVal () void DeleteVal (nodeptr head, int x) 5. Given a doubly linked list of sorted in descending order integers, write a routine that takes as an argument the head of the list and an integer x, and will remove ALL of the occurrences of integer x from the doubly linked list. The resulting list after the deletions should also be sorted in descending order. (10 points) For reference a node is declared as follows: typedef struct node *nodeptr; struct node { int value; nodeptr next; nodeptr prev; } here is how the head ptr was declared: nodeptr head; here is the function prototype for DeleteVal () void DeleteVal (nodeptr head, int x)

Answer rating: 100% (QA)

Here is the implementation of the DeleteVal function that removes all occurrences of integer x from ... View the full answer