Linked List (For Beginners) Explanation Without Code

Linked List

Linked List is a chain of nodes. In which each node contains data and reference of the next node. And that next node contain its own data and reference to the next node. Here reference is considered as address of the next node.

Here we can see the representation of the basic linked list. Here we have the first node contains the data "1" and the the "next " as the reference of the next node. Similarly the second node has its own data "2" and "next" as the reference of the next node. And so on.

Here we can the representation of a particular node containing its "data" and "address". And the whole thing is said as a single "NODE" .

The reference of the node 2 is stored in the node 1. And the reference of the node 3 is stored in node 2. And so on, but the reference of the first node is called as head. And the reference of the last node is called as tail and considered as "None".

Advantages of Linked List :-

1.) Due to dynamic data structure, we don't have to worry about the size and order of the linked list.

2.) Elements can be inserted and deleted from any position of the linked list.

3.) We can implement stacks, queues and graphs as linked list which we will learn in further blogs.

4.) It represents manipulate polynomials.

5.) We can see use of linked list in web browser from going to one to page to next page and the next page.

6.) We can see use of linked list in music player, image viewer etc.

Disadvantages of Linked List :-

1.) It needs extra memory in the device due to presence of data as well as address of the next node.

2.) No random access is possible. If want to reach at a particular node then have to travel from starting and stop at the wanted node.

TYPES OF LINKED LIST :-

1.) SINGLY LINKED LIST

2.) DOUBLY LINKED LIST

3.) CIRCULAR LINKED LIST

We will learn about these in next posts.

Hope you got the basic knowledge of LINKED LIST. IN our further posts we will describe those three . types of linked list with their Python Code. Hope you like this tutorial. Please share it with your friends and help them learning PYTHON.

John Veer

Contact mail id - john.veer.utube@gmail.com

Thanks for reading !

www.basicpythonprogramme.blogspot.com

Bye!

Comments

First Python Programme

If you are here, then I think you are a python enthusiast. On this website, we upload daily posts on new and basic programme for beginners. So let’s start with the first code i.e. Hello World programme. So first of all you you should know how to give print command in python. To print we write print(“Hello World”). What’s inside the small brackets will be printed. So the programme is : print("Hello World") Hello World So, as we can see above, when we implemented the print command, the thing between the small bracket is printed. So let’s see some other examples In this example, we will store an integer value in a variable. And then print the integer will the help,of that variable. So let’s get started a = 3 print(a) 3 Another example Now we will store a string into a variable and then print the string with the help of that variable #if we put hastag in front of any line in python. Then there is no effect. #for storing the string in a variable, we have to enclose the whole s...

Doubly Linked List in PYTHON

Here is the Python code for the Doubly Linked List :- #first of all creat a class node class Node : def __init__ ( self , data ): self . data = data self . next = None self . prev = None #now create a class of doubly linked list class DLL : def __init__ ( self ): self . head = None #function to insert the node at begining def insertatbeg ( self , data ): newnode = Node ( data ) newnode . prev = None newnode . next = self . head self . head = newnode #function to insert the node at the end def insertatend ( self , data ): newnode = Node ( data ) if self . head is None : self . head ...

Queues in PYTHON

The Python Code for Queue is here :- class Node: def __init__(self, data): self.data = data self.next = None class Queue: def __init__(self): self.front = self.rear = None def enqueue(self, data): newnode = Node(data) newnode.next = self.rear self.rear = newnode if self.front is None: self.front = newnode def dequeue(self): temp = self.rear while temp.next is not self.front: temp = temp.next self.front = temp temp.next = None def traverse(self): temp = self.rear while temp is not None: print(temp.data, end = " --> ") temp = temp.next print("None") new = Queue() new.enqueue(4) new.enqueue(1) new.enqueue(0) new.enqueue(2) new.traverse() new.dequeue() new.traverse() new.dequeue() new.traverse() 2 --> 0 --> 1 --> 4 --> None 2 --> 0 --> 1 --> None 2 ...

Basic Python Programs

Search This Blog