Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
34 views2 pages

Singly Linked List

This document defines functions for a singly linked list including insertStart to add a node to the beginning, deleteStart to remove a node from the beginning, and display to print the list. It tests the functions by creating a list with 5 nodes and then removing the first two nodes and displaying the updated list.

Uploaded by

animationmake14
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
34 views2 pages

Singly Linked List

This document defines functions for a singly linked list including insertStart to add a node to the beginning, deleteStart to remove a node from the beginning, and display to print the list. It tests the functions by creating a list with 5 nodes and then removing the first two nodes and displaying the updated list.

Uploaded by

animationmake14
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

singly linked list

#include<stdio.h>
#include<stdlib.h>

struct Node
{
int data;
struct Node *next;
};

void deleteStart (struct Node **head)


{
struct Node *temp = *head;

// if there are no nodes in Linked List can't delete


if (*head == NULL)
{
printf ("Linked List Empty, nothing to delete");
return;
}

// move head to next node


*head = (*head)->next;

printf ("\n%d deleted\n", temp->data);


free (temp);
}

void insertStart (struct Node **head, int data)


{

// dynamically create memory for this newNode


struct Node *newNode = (struct Node *) malloc (sizeof (struct Node));

// assign data value


newNode->data = data;
// change the next node of this newNode
// to current head of Linked List
newNode->next = *head;

//re-assign head to this newNode


*head = newNode;
printf ("\n%d Inserted\n", newNode->data);
}

void display (struct Node *node)


{
printf ("\nLinked List: ");

// as linked list will end when Node is Null


while (node != NULL)
{
printf ("%d ", node->data);
node = node->next;
}
printf ("\n");
}
int main ()
{
struct Node *head = NULL;

// Need '&' i.e. address as we need to change head


insertStart (&head, 100);
insertStart (&head, 80);
insertStart (&head, 60);
insertStart (&head, 40);
insertStart (&head, 20);

// No Need for '&' as not changing head in display operation


display (head);

deleteStart (&head);
deleteStart (&head);
display (head);

return 0;
}

output:-

100 Inserted

80 Inserted

60 Inserted

40 Inserted

20 Inserted

Linked List: 20 40 60 80 100

20 deleted

40 deleted

Linked List: 60 80 100

You might also like