Insert a Node at tail of a Linked List| Linked List
Task(easy)
Insert a Node at tail of a Linked List
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.
Function Description
Complete the insertNodeAtTail function in the editor below.
insertNodeAtTail has the following parameters:
- SinglyLinkedListNode pointer head: a reference to the head of a list
- int data: the data value for the node to insert
Returns
- SinglyLinkedListNode pointer: reference to the head of the modified linked list
Input Format
The first line contains an integer n, the number of elements in the linked list.
The next n lines contain an integer each, the value that needs to be inserted at tail.
Constraints
1≤n≤1000
1≤listi≤1000
Sample Input
STDIN Function
----- --------
5 size of linked list n = 5
141 linked list data values 141..474 302 164 530 474
Sample Output
141
302
164
530
474
SOLUTION 1
def insertNodeAtTail(head, data):
if head is None:
return SinglyLinkedListNode(data)
x = head
while x.next is not None:
x = x.next
x.next = SinglyLinkedListNode(data)
return head
EXPLANATION STEPS
- Create the New Node: Allocate and initialize the new node with the given value.
- Check if List is Empty: If the head is
null, set the head to the new node. - Traverse to End: If the list is not empty, traverse to the last node (where
nextisnull). - Insert the Node: Set the
nextpointer of the last node to the new node.
