Answer to Question #287802 in C++ for Roe

Question

Write a c++ program that contains functions

Singly linked list implementation :

1)insert a node after a given node

2)insert a node before a given node

3)delete a node after a node

4)delete a node before a node

5) make a search function that returns a node

Note:

No global declarations

Call the functions in main

Answer 1

struct node *newNode;
newNode = malloc(sizeof(struct node));
newNode->data = 4;
newNode->next = head;
head = newNode;


struct node *newNode;
newNode = malloc(sizeof(struct node));
newNode->data = 4;

struct node *temp = head;

for(int i=2; i < position; i++) {
  if(temp->next != NULL) {
    temp = temp->next;
  }
}
newNode->next = temp->next;
temp->next = newNode;

struct node* temp = head;
while(temp->next->next!=NULL){
  temp = temp->next;
}
temp->next = NULL;

for(int i=2; i< position; i++) {
  if(temp->next!=NULL) {
    temp = temp->next;
  }
}

temp->next = temp->next->next;