Insert a Node at the Tail of a Linked List

Sort by

recency

|

1754 Discussions

|

  • + 0 comments

    Hello developers now i am solve the problem with javascript

    For Just understanding i am not giving the full answer to you i will give you the hints okh bro condition if the head is empty

    // make the new node => let newNode =new singlyLinkedList(data); let currentNode=head; loop and find the prevous node of the tail currentNode=currentNode.next

    currentNode.next=newNode

  • + 0 comments

    Here is my c++ solution, you can watch this video explanation here : https://youtu.be/zwvWP4YmsoM

    SinglyLinkedListNode* insertNodeAtTail(SinglyLinkedListNode* head, int data) {
        SinglyLinkedListNode* newNode = new SinglyLinkedListNode(data);
        if(head != nullptr) {
            SinglyLinkedListNode* curr = head;
            while(curr->next) curr = curr->next;
            curr->next = newNode;
            return head;
        }
        return newNode;
    }
    
  • + 0 comments

    There is a compilation error in the provided Python code. Please fix

  • + 0 comments

    Here is my csharp solution:

    static SinglyLinkedListNode insertNodeAtTail(SinglyLinkedListNode head, int data) {
            
            SinglyLinkedListNode curr = head;
            SinglyLinkedListNode n1 = new SinglyLinkedListNode(data);
            
            if(head == null)
            {
                head = n1;
                Console.WriteLine(head.data);
            }
            else
            {
                if(curr.next == null)
                    head.next = n1;
                else
                {
                    while(curr.next != null)
                        curr = curr.next;
                    
                    curr.next = n1;
                }
                Console.WriteLine(head.next.data);
            }
            
            return head;
        }
    
  • + 0 comments
    static SinglyLinkedListNode insertNodeAtTail(SinglyLinkedListNode head, int data) {
    

    SinglyLinkedListNode temp = head; SinglyLinkedListNode a = new SinglyLinkedListNode(data); if(temp == null){ temp = a; return temp; } while(temp.next !=null){ temp=temp.next; } temp.next = a; temp = a; return head;

    }