Scribd
Upload
20 views3 pages

Double Linked Listt

Uploaded by

pajec36785
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views3 pages

Double Linked Listt

Uploaded by

pajec36785
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

# Creating a node class

class Node:
def __init__(self, data):
self.data = data #adding an element to the node
self.next = None # Initally this node will not be linked with any other node
self.prev = None # It will not be linked in either direction

class DoublyLinkedList:
def __init__(self):
self.head = None # Initally there are no elements in the list

# Creating a node class


class Node:
def __init__(self, data):
self.data = data #adding an element to the node
self.next = None # Initally this node will not be linked with any other node
self.prev = None # It will not be linked in either direction

# Creating a doubly linked list class


class DoublyLinkedList:
def __init__(self):
self.head = None # Initally there are no elements in the list
self.tail = None

def push_front(self, new_data): # Adding an element before the first element


new_node = Node(new_data) # creating a new node with the desired value
new_node.next = self.head # newly created node's next pointer will refer to the old head

if self.head != None: # Checks whether list is empty or not


self.head.prev = new_node # old head's previous pointer will refer to newly created node
self.head = new_node # new node becomes the new head
new_node.prev = None

else: # If the list is empty, make new node both head and tail
self.head = new_node
self.tail = new_node
new_node.prev = None # There's only one element so both pointers refer to null

def push_back(self, new_data): # Adding an element after the last element


new_node = Node(new_data)
new_node.prev = self.tail

if self.tail == None: # checks whether the list is empty, if so make both head and tail as new node
self.head = new_node
self.tail = new_node
new_node.next = None # the first element's previous pointer has to refer to null

else: # If list is not empty, change pointers accordingly


self.tail.next = new_node
new_node.next = None
self.tail = new_node # Make new node the new tail

def peek_front(self): # returns first element


if self.head == None: # checks whether list is empty or not
print("List is empty")
else:
return self.head.data

def peek_back(self): # returns last element


if self.tail == None: # checks whether list is empty or not
print("List is empty")
else:
return self.tail.data

def pop_front(self): # removes and returns the first element


if self.head == None:
print("List is empty")

else:
temp = self.head
temp.next.prev = None # remove previous pointer referring to old head
self.head = temp.next # make second element the new head
temp.next = None # remove next pointer referring to new head
return temp.data

def pop_back(self): # removes and returns the last element


if self.tail == None:
print("List is empty")

else:
temp = self.tail
temp.prev.next = None # removes next pointer referring to old tail
self.tail = temp.prev # make second to last element the new tail
temp.prev = None # remove previous pointer referring to new tail
return temp.data

def insert_after(self, temp_node, new_data): # Inserting a new node after a given node
if temp_node == None:
print("Given node is empty")

if temp_node != None:
new_node = Node(new_data)
new_node.next = temp_node.next
temp_node.next = new_node
new_node.prev = temp_node
if new_node.next != None:
new_node.next.prev = new_node

if temp_node == self.tail: # checks whether new node is being added to the last element
self.tail = new_node # makes new node the new tail

def insert_before(self, temp_node, new_data): # Inserting a new node before a given node
if temp_node == None:
print("Given node is empty")

if temp_node != None:
new_node.prev = temp_node.prev
temp_node.prev = new_node
new_node.next = temp_node
if new_node.prev != None:
new_node.prev.next = new_node

if temp_node == self.head: # checks whether new node is being added before the first element
self.head = new_node # makes new node the new head

You might also like