Singly Linked List is PYTHON

Here is the python code for singly linked list :-

#first of all make a node class as given below

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

#now create a linkedlist class to insert and delete the nodes

class LL:
    def __init__(self):
        self.head = None

#function to insert the node at begining

def insertatbeg(self, data):
        newnode = Node(data)
        if self.head is None:
            self.head = newnode
        else:
            newnode.next = self.head
            self.head = newnode
        
#function to insert the node at last

def insertatend(self, data):
        newnode = Node(data)
        if self.head is None:
            self.head = newnode
            return
        else:
            temp = self.head
            while temp.next is not None:
                temp = temp.next
            temp.next = newnode
            newnode.next = None

#function to insert the node at a given position

def insertinbet(self, node, data):
        if node is None:
            print("Position is invalid.")
            return
        else:
            newnode = Node(data)
            newnode.next = node.next
            node.next = newnode

#function to delete the node from the given position
#we can also make functions to delete from begining and delete from end

def deletenode(self, pos):
        data = pos.data
        while pos.data is not data:
            pos = pos.next
        pos.data = pos.next.data
        pos.next = pos.next.next

#function to print the linked list

def traverse(self):
        temp = self.head
        while temp is not None:
            print(temp.data, "--> ", end="")
            temp = temp.next

new = LL()

#here "new" is a included in LL (LinkedList)

new.insertatbeg(5)
new.insertatbeg(3)
new.insertatbeg(2)
new.insertatbeg(1)
new.insertatend(6)
new.insertatend(7)
new.insertinbet(new.head.next.next, 4)
new.deletenode(new.head)

#to print the linkedlist

new.traverse()

print("None")

Share it with your friends and help them learning python. In the next post, I will upload the python code for doubly linked list.

John Veer

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

Thanks for reading !

www.basicpythonprogramme.blogspot.com

print("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...

Classes and Objects in PYTHON (Object Oriented Programming)

Solving a problem by creating objects is one of the most popular approach in programming. This is called Object Oriented Programming This concept is based on using reusable code but differently from functions. It is based on DRY (Don't Repeat Yourself) Principle. CLASS :- A class is a blueprint for creating objects. It can described as a group of objects. Objects are the instances of a class. We will further define this in our upcoming code in this post. Lets see a basic program for the class and objects to understand it properly. class Students: pass #we have three students alok, vinay and aashish alok = Students() vinay = Students() aashish = Students() #there data is given as per alok.name = "Alok Kumar" alok.age = 17 alok.standard = "11 th" vinay.name = "Vinay Sharma" vinay.age = 18 vinay.standard = "12 th" aashish.name = "Aashish Mishra" aashish.age = 16 aashish.standard = "10 th" print(vinay) print(alok.a...

Basic Python Programs

Search This Blog