Computer Science · Data Structures

Consider a singly linked list containing elements 10 and 20 in order. If we execute the following function as insertEnd(&head, 30), what will be the resulting list structure? struct Node { int data; Node* next; }; void insertEnd(Node head, int val) { Node* newNode = new Node{val, nullptr}; if (head == nullptr) { head = newNode; return; } Node temp = head; while (temp->next != nullptr) temp = temp->next; temp->next = newNode; }