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

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