PASSED: linkedListToString(list) PASSED: list->head->data42 PASSED: list->tail->
ID: 3728811 • Letter: P
Question
PASSED: linkedListToString(list) PASSED: list->head->data42 PASSED: list->tail->data 25 FAILED: list after adding 25 Expected: [42]-[571->I611->[25]-null Actual: [42]->[571->[611->null PASSED: list->head->data42 PASSED: list->tail->data 31 FAILED: ist after adding 31 Expected: [42]->[57]->[61]->[25]->[31]->null Actual: [42]->[57]->[61]->null PASSED: list->headNULL PASSED: list->tailNULL) PASSED: linkedListToString(list) PASSED PASSED: list->head->data7 PASSED PASSED: list->tail->data7) PASSED: list after adding 7 PASSED: list != NULL PASSED: list->headlist-tail hot 0. FAILED: ist after adding -6 Expected: [71->C-6]->null Actual: [71-null PASSED: PASSED: list->head->data7 PASSED PASSED: list-»tail->data 6) Screen ShotExplanation / Answer
From the given question what is understandable is a node is to be inserted at the last of a single linkedList anf head and tail pointer should be updated accordingly; To do this use the given function below:
void addIntToEndOfList(LinkedList *list,int value)
{
assert(list!=NULL);
//if list is empty
if(list->head==NULL)
{
Node * p = new Node;
p->data=value;
p->next=NULL;
list->head=p;
list->tail=p;
}
//when list is not empty
else
{
Node * p = new Node;
p->data=value;
p->next=NULL;
list->tail=p;
}
}
/*NOTE: If you want to change something or want in a different way, please let me know through comments; I will surely revert back to you.*/
/*Hope this helps. Thank you.*/
/*If this helps you, please let me know by giving a positive thumbs up. In case you have any queries, do let me know. I will revert back to you. Thank you!!*/
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.