Insert a node at the tail of a linked list C++
|
X Privacy & CookiesThis site uses cookies. By continuing, you agree to their use. Learn more, including how to control cookies. Got It! Advertisements 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. Input Format You have to complete theSinglyLinkedListNode insertAtTail(SinglyLinkedListNode head, int data)method. It takes two arguments: the head of the linked list and the integer to insert at tail. You shouldnotread any input from the stdin/console. The input is handled by code editor and is as follows: Constraints
Output Format Insert the new node at the tail and justreturnthe head of the updated linked list. Donotprint anything to stdout/console. The output is handled by code in the editor and is as follows: Sample Input 5
141
302
164
530
474
Sample Output 141
302
164
530
474
Explanation First the linked list is NULL. After inserting 141, the list is 141 -> NULL. Code: static SinglyLinkedListNode insertNodeAtTail(SinglyLinkedListNode head, int data) {
SinglyLinkedListNode temp = head;
SinglyLinkedListNode insertNode = new SinglyLinkedListNode(data);
if(head == null) {
return insertNode;
}
while(temp.next != null) {
temp = temp.next;
}
temp.next = insertNode;
insertNode.next = null;
return head;
}
Time complexity of insertat tail is O(n) where n is the number of nodes in linked list. Since there is a loop from head to end, the function does O(n) work. Hope you guys understand the simple solution of inserting a node at tail in linked list in java. In next blog we will see other operations on linked list till then Bye Bye..! Thanks for reading! Happy Coding..! Thank You! Advertisements Share this: |
