We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Insert a node at a specific position in a linked list
  5. Discussions

Insert a node at a specific position in a linked list

Sort 1358 Discussions, By:

  • btech2021_ankit1
     + 0 comments

    C LANGUAGE CODE

    SinglyLinkedListNode* insertNodeAtPosition(SinglyLinkedListNode* llist, int data, int position) { SinglyLinkedListNode*temp; temp=(SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode)); temp->data=data; temp->next=0; if(llist==0) llist=temp; else {int i=1; SinglyLinkedListNode*p,*q; q=llist; p=llist->next; while(position>i) { q=q->next; p=p->next; i++; } temp->next=p; q->next=temp;

    }
return llist;

    }

  • btech2021_ankit1
     + 0 comments

    C LANGUAGE CODE

    SinglyLinkedListNode* insertNodeAtPosition(SinglyLinkedListNode* llist, int data, int position) { SinglyLinkedListNode*temp; temp=(SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode)); temp->data=data; temp->next=0; if(llist==0) llist=temp; else {int i=1; SinglyLinkedListNode*p,*q; q=llist; p=llist->next; while(position>i) { q=q->next; p=p->next; i++; } temp->next=p; q->next=temp;

    }
return llist;

    }

  • btech2021_ankit1
     + 0 comments

    C LANGUAGE CODE

    SinglyLinkedListNode* insertNodeAtPosition(SinglyLinkedListNode* llist, int data, int position) { SinglyLinkedListNode*temp; temp=(SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode)); temp->data=data; temp->next=0; if(llist==0) llist=temp; else {int i=1; SinglyLinkedListNode*p,*q; q=llist; p=llist->next; while(position>i) { q=q->next; p=p->next; i++; } temp->next=p; q->next=temp;

    }
return llist;

    }

  • hi_apoorvaraj
     + 0 comments

    Python 3

    def insertNodeAtPosition(llist, data, position):
    # Write your code here
    n = SinglyLinkedListNode(data)
    if position == 0:
        llist = n
    else:    
        prev = llist
        cur = prev.next
        i=0
        while i<(position-1):
            prev = prev.next
            cur = cur.next
            i+=1
        prev.next = n
        n.next = cur
    return llist

  • Devanshu0602
     + 0 comments
    SinglyLinkedListNode* insertNodeAtPosition(SinglyLinkedListNode* llist, int data, int position) {
    SinglyLinkedListNode* newnode = (SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode));
    newnode->data = data;
    newnode->next = NULL;
    
    SinglyLinkedListNode* temp = llist;
    
    if(llist == NULL) {
        llist = newnode;
    }
    else {
        for (int i=1; i<position; i++) {
            temp = temp->next;
        }
        newnode->next = temp->next;
        temp->next = newnode;
    }
    return llist;
}
Load more conversations