(c) Given the following source code: void linkedListType:: insertNode (const int newItem) { nodeType *newNode=new nodeType;...

Transcribed Image Text:

(c) Given the following source code: void linkedListType:: insertNode (const int newItem) { nodeType *newNode=new nodeType; newNode->info=newItem; newNode->link=NULL; if (first==NULL) { first newNode; last=newNode; //refPoint is a pointer which always point to the first node insert in the list refPoint newNode; } else { newnode->link=first; first newNode; count++; } } Modify the above code, so that if the new item is bigger than the value in the node pointed by the pointer ref Point, add new item at the end of the linked list. Otherwise add new item at the front of the linked list. (30/100) (c) Given the following source code: void linkedListType:: insertNode (const int newItem) { nodeType *newNode=new nodeType; newNode->info=newItem; newNode->link=NULL; if (first==NULL) { first newNode; last=newNode; //refPoint is a pointer which always point to the first node insert in the list refPoint newNode; } else { newnode->link=first; first newNode; count++; } } Modify the above code, so that if the new item is bigger than the value in the node pointed by the pointer ref Point, add new item at the end of the linked list. Otherwise add new item at the front of the linked list. (30/100)