Data Structure & Algorithmes

(Data Structure & Algorithms (CSNB344) Question 56 Not yet answered Marked out of 6.00 Suppose head and p are pointers of linked list nodes. Explain the effect of the following code fragments: a) Node *p, *temp = head; new Node (); while (temp->next != NULL) temp = temp->next; temp->next = p; Flag question b) Node *p = new Node(); p->next = head->next; head->next = p; c) Node *p head) head- head->next; free (p) Paragraph