Header Ads Widget

Introduction to Linked list in data structure

Linked list in data structure

In this Article, you will going to learn about what linked list is and what are the applications of linked list, so let’s start with the help of some real life example.

So many time you plays treasure hunt game so basically in this game you first start by looking one clue and when you find it, that first clue gives you the direction of next clue you keep following that clues until you win.

A linked list is as similar to that game linked list is a series of connected “nodes” because that one node has address of next node.

Each node stores two main things and that are one variable and address of next variable.


Representation of linked list

Linked list in data structure

This is the same as treasure hunt game you find the first clue and you looking for next so here we call that first clue “Head”.

And the last clue as “NULL”.    

Here data means value of any variable or we can say any data and next means address of next variable or data. Hope so you understand.


Difference between array and linked list

As we know array stores data in linear manner which has same data type. Linked list is also works like array but in different manner.

Linked list stores data but not in linear manner.

Let’s understand with the help of example.

You can define array as:

int a[3];

so memory manager allocates memory in linear manner suppose you stores 1,2,3 so the address becomes 112,113,114 so array stores data in linear. But linked list is different let’s see.

You can define linked list as:

Struct a


          Int data;

          Struct a *next;


So memory manager allocate memory to them in linked list manner not in linear manner so that particular variable can store two things one is their own data and address of next variable so it calls linked list.

So with the help of linked list we can solve the main problem of array.

As we all know memory is very important thing so we need to save that some time we just need 4 bytes in are array but for backup we take the size of array around 50 so this is very big wastage of memory so for that we can use linked list it helps us to prevent memory. 


Linked list Utility

Link list are one of the most popular data structure and also you can implement linked list in most of the programming languages like C, Python, C#, C++ and java.

Apart from them linked list is very easy and efficient way to learn that how pointers are work in are programs and if you practice linked list you can be very good at linked list.


Applications of Linked list

·         It allows us for dynamic memory allocation.

·         We can implement it in stack and queue.

·         We can use this in implementation of graphs.

·         It helps to maintain the names of directory.

·         It can perform arithmetic operation on integers.

·         It also used in hash tables.


Types of Linked list

·         Simple linked list

·         Doubly linked list

·         Circular linked list


Basic Operations in Linked list

·         Insertion

·         Display

·         Deletion

·         Search

·         delete


So After Reading this full article on Linked list hope so you can find the answer want you want so do comments and do not forget to share this article to your friends and for more update do email subscription so you can get direct notification in your mail box thank you for reading the article.

Image Credits goes to : Programiz

If you are not aware about are operating system tutorials then must read from are site here i am puting all the links read that for batter understanding.

Post a comment