This challenge is part of a tutorial track by MyCodeSchool and is accompanied by a video lesson.
You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty.
You have to complete the Node* Insert(Node* head, int data) method. It takes two arguments: the head of the linked list and the integer to insert. You should not read any input from the stdin/console.
Insert the new node at the tail and just return the head of the updated linked list. Do not print anything to stdout/console.
NULL, data =
--> NULL, data =
2 --> 3 --> NULL
1. We have an empty list, and we insert .
2. We start with a in the tail. When is inserted, then becomes the tail.