Scribd
Upload
9 views

Lesson3a - Linked List Data Structure

Data Structure.

Uploaded by

Young Bandit
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views

Lesson3a - Linked List Data Structure

Data Structure.

Uploaded by

Young Bandit
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Singly Linked List

Like arrays, Linked List is a linear data structure. Unlike arrays, linked list elements are
not stored at contiguous memory locations; the elements are linked using pointers.

int number1; //stores data values

int * pointer1; //stores a memory address

Why Linked List?

Arrays can be used to store linear data of similar types, but arrays have following
limitations.

1) The size of the arrays is fixed: So we must know the upper limit on the number of
elements in advance. Also, generally, the allocated memory is equal to the upper limit
irrespective of the usage.
2) Inserting a new element in an array of elements is expensive, because room has to
be created for the new elements and to create room existing elements have to shifted.

For example, in a system if we maintain a sorted list of IDs in an array id[].


id[] = {1000, 1010, 1050, 2000, 2040}.

And if we want to insert a new ID 1005, then to maintain the sorted order, we have to
move all the elements after 1000 (excluding 1000).

3. Deletion is also expensive with arrays unless some special techniques are used.

For example, to delete 1010 in id[], everything after 1010 has to be moved.
Advantages of linked list over arrays
1) Dynamic size
2) Ease of insertion/deletion

Disadvantages of Linked Lists


1) Random access is not allowed. We have to access elements sequentially starting
from the first node. So we cannot do binary search with linked lists efficiently with its
default implementation.
2) Extra memory space for a pointer is required with each element of the list.
3) Not cache friendly. Since array elements are contiguous locations, there is locality of
reference which is not there in case of linked lists.

representation:
A linked list is represented by a pointer to the first node of the linked list. The first node
is called head. If the linked list is empty, then value of head is NULL.

Each node in a list consists of at least two parts (or two fields):

1) data
2) Pointer (Or Reference) to the next node

In C, we can represent a node using structures. Below is an example of a linked list


node with an integer data.

// A linked list node

Snippete;

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

Sample code:

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

struct node
{
int num; //Data of the node
struct node *nextptr; //Address of the next node
}*stnode;

void createNodeList(int n); // function to create the list


void displayList(); // function to display the list

int main()
{
int n;
printf("\n\n Linked List : To create and display Singly
Linked List :\n");

printf("-------------------------------------------------------------\
n");

printf(" Input the number of nodes : ");


scanf("%d", &n);
createNodeList(n);
printf("\n Data entered in the list : \n");
displayList();
return 0;
}
void createNodeList(int n)
{
struct node *fnNode, *tmp;
int num, i;
stnode = (struct node *)malloc(sizeof(struct node));

if(stnode == NULL) //check whether the fnnode is NULL and if so no


memory allocation
{
printf(" Memory can not be allocated.");
}
else
{
// reads data for the node through keyboard

printf(" Input data for node 1 : ");


scanf("%d", &num);
stnode->num = num;
stnode->nextptr = NULL; // links the address field to NULL
tmp = stnode;
// Creating n nodes and adding to linked list
for(i=2; i<=n; i++)
{
fnNode = (struct node *)malloc(sizeof(struct node));
if(fnNode == NULL)
{
printf(" Memory can not be allocated.");
break;
}
else
{
printf(" Input data for node %d : ", i);
scanf(" %d", &num);

fnNode->num = num; // links the num field of


fnNode with num
fnNode->nextptr = NULL; // links the address field of
fnNode with NULL

tmp->nextptr = fnNode; // links previous node i.e. tmp


to the fnNode
tmp = tmp->nextptr;
}
}
}
}
void displayList()
{
struct node *tmp;
if(stnode == NULL)
{
printf(" List is empty.");
}
else
{
tmp = stnode;
while(tmp != NULL)
{
printf(" Data = %d\n", tmp->num); // prints the data
of current node
tmp = tmp->nextptr; // advances the
position of current node
}
}
}

You might also like