Answers for "insertion in linked list"

linked list insertion in c++

#include <iostream>
// Linked list
struct node {
    int data ;
    node * link;
};


node * Node(int data) {
    node * temp = new node();
    temp->data = data;
    temp->link = NULL;
    return temp;
}

void append(node ** head, int data) {

    if(*head == NULL) {
        *head =  Node(data);
    }else {
        node * temp = * head;
        while (temp->link != NULL) {
            temp=temp->link;
        }
        temp->link = Node(data);

    }

}


// insertion at begining

void insertBeg(node **head , int data) {
    if(*head == NULL) {
        * head = Node(data);
    }else {
        node * temp = Node(data);
        temp->link = *head;
        *head = temp;

    }


}
// insert at specific position

void addafter(node * head , int loc , int data) {
    node * temp , * r ;
    temp = head ;
    for( int i = 0 ; i<loc;i++ ) {
        temp = temp->link;
        if(temp == NULL) {
            cout<<"there ar less elemtns" ;
            return;
        }

    }
    // insert new node
    r = Node(data);
    r->link = temp->link;
    temp->link = r;


}

void display(node * head) {

    node * temp = head;
    while(temp!= NULL) {
        cout<<temp->data<<" ";
        temp = temp->link;
    }
}



int main() {
    node * head = NULL;
    append(&head,5);
    append(&head,5);
    append(&head,5);
    append(&head,5);
    display(head);
    cout<<endl;
    insertBeg(&head,6);
    insertBeg(&head,6);
    insertBeg(&head,6);
    display(head);
addafter(head,4,7);
cout<<endl;
display(head);

    return 0;
}

insertion in linked list

#include <iostream>
#include<stdio.h>
// Linked list
struct node {
    int data ;
    node * link;
};


node * Node(int data) {
    node * temp = new node();
    temp->data = data;
    temp->link = NULL;
    return temp;
}

void append(node ** head, int data) {

    if(*head == NULL) {
        *head =  Node(data);
    }else {
        node * temp = * head;
        while (temp->link != NULL) {
            temp=temp->link;
        }
        temp->link = Node(data);

    }

}


// insertion at begining

void insertBeg(node **head , int data) {
    if(*head == NULL) {
        * head = Node(data);
    }else {
        node * temp = Node(data);
        temp->link = *head;
        *head = temp;

    }


}
// insert at specific position

void addafter(node * head , int loc , int data) {
    node * temp , * r ;
    temp = head ;
    for( int i = 0 ; i<loc;i++ ) {
        temp = temp->link;
        if(temp == NULL) {
            cout<<"there ar less elemtns" ;
            return;
        }

    }
    // insert new node
    r = Node(data);
    r->link = temp->link;
    temp->link = r;


}

void display(node * head) {

    node * temp = head;
    while(temp!= NULL) {
        cout<<temp->data<<" ";
        temp = temp->link;
    }
}



int main() {
    node * head = NULL;
    append(&head,5);
    append(&head,5);
    append(&head,5);
    append(&head,5);
    display(head);
    cout<<endl;
    insertBeg(&head,6);
    insertBeg(&head,6);
    insertBeg(&head,6);
    display(head);
addafter(head,4,7);
cout<<endl;
display(head);

    return 0;
}

Inserting in a linked list

class Node:
   def __init__(self, dataval=None):
      self.dataval = dataval
      self.nextval = None

class SLinkedList:
   def __init__(self):
      self.headval = None
# Print the linked list
   def listprint(self):
      printval = self.headval
      while printval is not None:
         print (printval.dataval)
         printval = printval.nextval
   def AtBegining(self,newdata):
      NewNode = Node(newdata)

# Update the new nodes next val to existing node
   NewNode.nextval = self.headval
   self.headval = NewNode

list = SLinkedList()
list.headval = Node("Mon")
e2 = Node("Tue")
e3 = Node("Wed")

list.headval.nextval = e2
e2.nextval = e3

list.AtBegining("Sun")
list.listprint()