Linked List Data Structure: Implementation and Operations in C, Slides of Computer Programming

Download Linked List Data Structure: Implementation and Operations in C and more Slides Computer Programming in PDF only on Docsity!

Linked List

Linked List

struct node

int data;

struct node *next;

#include<stdio.h>

#include<stdlib.h>

struct node

{

int data; struct node *next;

};

void display (struct node* head)

{

struct node *temp = head; printf("\n\nList elements are - \n"); while(temp != NULL) { printf("%d --->",temp->data); temp = temp->next; }

}

void insertAtMiddle (struct node *head, int position, int value) { struct node *temp = head; struct node newNode; newNode = (node)malloc(sizeof(struct node)); newNode->data = value;

int i;

for(i=0; i<position-1&& temp!=NULL;i++) { temp = temp->next; }

newNode->next = temp->next; temp->next = newNode; }

void insertAtFront (struct node** head, int value) {

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

}

void deleteFromFront (struct node** headRef){ head=(head)->next; }