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

Bubble Sort Algorithm in PYTHON

What is Bubble Sort ? And why do we need this ? Bubble sort is the simplest algorithm to sort any array. Due to its simplicity, bubble sort is often used to introduce the concept of a sorting algorithm. In computer graphics it is popular for its capability to detect a very small error (like swap of just two elements) in almost-sorted arrays and fix it with just linear complexity (2n). For example, it is used in a polygon filling algorithm, where bounding lines are sorted by their x coordinate at a specific scan line (a line parallel to x axis) and with incrementing y their order changes . ALGORITHM :- 1.) Firstly we have an unsorted list, which is to be sorted. 2.) Consider the first element of the list. Then compare it with the next element. 3.) If the second element is greator than the first element than swap them. 4.) If the second element is smaller than the first element, then we don't have to do anything. 5.) Going ahead, now after swap (may or may not), look for second...

Merge Sort Algorithm in PYTHON

First of all, Why do we need to learn so many sorting algorithms? We need to learn so many sorting algorithms because there are cases in which which algorithm fits best. According to the time complexity, we have to choose an algorithm of our use. That's why we are learning so many sorting algorithms. SO LETS START WITH THE MERGE SORT In computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the order of equal elements is the same in the input and output. It is one of the most popular algorithms and one of the most stable sorting algorithm. ALGORITHM 1.) First of all take a list and put it in a function (recursion) that it breaks itself into two halves. 2.) When we get the two halves, the recursion code will automatically breaks the two halves into four parts and then into 8 parts until each...

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