Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Linked Lists #11

Merged
merged 9 commits into from
Oct 2, 2024
Merged

Linked Lists #11

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
39a30cb
Linked Lists
aviralgarg05 Oct 1, 2024
db2f6e3
Update README.md
aviralgarg05 Oct 1, 2024
a760add
Merge branch 'UTSAVS26:main' into main
aviralgarg05 Oct 1, 2024
d6c4f70
Update Menu_Driven_Code_for_Circular_Doubly_LinkedList.py
aviralgarg05 Oct 1, 2024
e028a51
Update Menu_Driven_Code_for_Circular_LinkedList.py
aviralgarg05 Oct 1, 2024
a1ef6e2
Update Menu_Driven_Code_for_Doubly_LinkedList.py
aviralgarg05 Oct 1, 2024
b207e54
Update Menu_Driven_Code_for_Dynamic_Linear_Queue_using_LinkedList.py
aviralgarg05 Oct 1, 2024
ead0bde
Update Menu_Driven_Code_for_Dynamic_Stack_using_LinkedList.py
aviralgarg05 Oct 1, 2024
4f4dc7d
Update Menu_Driven_Code_for_Linear_LinkedList.py
aviralgarg05 Oct 1, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
185 changes: 185 additions & 0 deletions ...rithms_and_Data_Structures/Linked List/Menu_Driven_Code_for_Circular_Doubly_LinkedList.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,185 @@
class Node:
"""
Node class for circular doubly linked list.

Args:
data (int): The value to be stored in the node.
"""

def __init__(self, data):
"""
Initializes a new node with the given data and sets the left and right pointers to None.
"""
self.data = data
self.right = None
self.left = None


class LinkedList:
"""
Circular Doubly Linked List implementation with various operations.
"""

def __init__(self):
"""
Initializes an empty circular doubly linked list with root and last pointers set to None.
"""
self.root = None
self.last = None

def insertLeft(self, data):
"""
Inserts a new node at the left (beginning) of the circular doubly linked list.

Args:
data (int): The value to be inserted at the left.
"""
n = Node(data)
if self.root == None:
# If list is empty, initialize both root and last to the new node.
self.root = n
self.last = n
self.last.right = self.root
self.root.left = self.last
else:
# Insert the new node to the left of root and update pointers.
n.right = self.root
self.root.left = n
self.root = n
self.last.right = self.root
self.root.left = self.last
print('\nInserted Element: ', self.root.data)
self.printList()

def deleteLeft(self):
"""
Deletes a node from the left (beginning) of the circular doubly linked list.
"""
if self.root == None:
print('\nLinked List is empty..!!')
else:
temp = self.root
if self.root == self.last:
# If there is only one node, set root and last to None.
self.root = None
else:
# Delete the root and update pointers.
self.root = self.root.right
self.root.left = self.last
self.last.right = self.root
print('\nDeleted element: ', temp.data)
self.printList()

def insertRight(self, data):
"""
Inserts a new node at the right (end) of the circular doubly linked list.

Args:
data (int): The value to be inserted at the right.
"""
n = Node(data)
if self.root == None:
# If list is empty, initialize both root and last to the new node.
self.root = n
self.last = n
self.last.right = self.root
self.root.left = self.last
else:
# Insert the new node to the right of the last node and update pointers.
self.last.right = n
n.left = self.last
self.last = n
self.last.right = self.root
self.root.left = self.last
print('\nInserted Element: ', n.data)
self.printList()

def deleteRight(self):
"""
Deletes a node from the right (end) of the circular doubly linked list.
"""
if self.root == None:
print('\nLinked List is empty..!!')
else:
if self.root == self.last:
# If there is only one node, set root and last to None.
self.root = None
else:
# Delete the last node and update pointers.
print('Deleted Element: ', self.last.data)
self.last = self.last.left
self.last.right = self.root
self.root.left = self.last
self.printList()

def printList(self):
"""
Prints all elements in the circular doubly linked list in forward order.
"""
if self.root == None:
print('\nLinked List is empty..!!')
return
temp = self.root
print('\nElements in Linked List are: ')
while True:
print('|', temp.data, '| <-> ', end='')
temp = temp.right
if temp == self.root:
break
print('Root')
print()

def printReverseList(self):
"""
Prints all elements in the circular doubly linked list in reverse order.
"""
if self.root == None:
print('\nLinked List is empty..!!')
return
temp = self.last
print('\nElements in Linked List are: ')
while True:
print('|', temp.data, '| <-> ', end='')
temp = temp.left
if temp == self.last:
break
print('Last')
print()


# Main menu-driven code to interact with the linked list.
o = LinkedList()

while True:
print('----------------------')
print('\n1. Insert from Left\n2. Insert from Right\n3. Delete from Left\n4. Delete from Right\n5. Print Linked List\n6. Print Reverse Linked List\n0. Exit')
print('----------------------')

ch = int(input('\nEnter your choice: '))

if ch == 1:
data = int(input('\nEnter value to be inserted in left: '))
o.insertLeft(data)

elif ch == 2:
data = int(input('\nEnter value to be inserted in right: '))
o.insertRight(data)

elif ch == 3:
o.deleteLeft()

elif ch == 4:
o.deleteRight()

elif ch == 5:
o.printList()

elif ch == 6:
o.printReverseList()

elif ch == 0:
print('You are out of the program..!!')
break

else:
print('\nWrong Input..\nEnter the correct choice..!!\n')
156 changes: 156 additions & 0 deletions Algorithms_and_Data_Structures/Linked List/Menu_Driven_Code_for_Circular_LinkedList.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,156 @@
class Node:
"""
Node class for Circular Linked List.

Args:
data (int): The value to be stored in the node.
"""
def __init__(self, data):
"""
Initializes a new node with the given data and sets the next pointer to None.

Args:
data (int): The data to store in the node.
"""
self.data = data
self.next = None


class LinkedList:
"""
Circular Linked List implementation with insertion, deletion, and print operations.
"""
def __init__(self):
"""
Initializes an empty circular linked list with root and last pointers set to None.
"""
self.root = None
self.last = None

def insertLeft(self, data):
"""
Inserts a new node at the left (beginning) of the circular linked list.

Args:
data (int): The value to be inserted at the left.
"""
n = Node(data)
if self.root == None:
# If the list is empty, initialize both root and last to the new node.
self.root = n
self.last = n
self.last.next = self.root
else:
# Insert the new node at the beginning and update root and last.next.
n.next = self.root
self.root = n
self.last.next = self.root

def deleteLeft(self):
"""
Deletes a node from the left (beginning) of the circular linked list.
"""
if self.root == None:
print('\nLinked List is empty..!!')
else:
temp = self.root
if self.root == self.last:
# If there is only one node, set root and last to None.
self.last = self.root = None
else:
# Update root to the next node and adjust the last.next pointer.
self.root = self.root.next
self.last.next = self.root
print('\nDeleted element: ', temp.data)

def insertRight(self, data):
"""
Inserts a new node at the right (end) of the circular linked list.

Args:
data (int): The value to be inserted at the right.
"""
n = Node(data)
if self.root == None:
# If the list is empty, initialize both root and last to the new node.
self.root = n
self.last = n
self.last.next = self.root
else:
# Insert the new node at the end and update last and last.next.
self.last.next = n
self.last = n
self.last.next = self.root

def deleteRight(self):
"""
Deletes a node from the right (end) of the circular linked list.
"""
if self.root == None:
print('\nLinked List is empty..!!')
else:
if self.root == self.last:
# If there is only one node, set root and last to None.
self.root = self.last = None
else:
# Traverse to the second-last node and update last to the second-last node.
temp = self.root
temp2 = self.root
while temp.next != self.root:
temp2 = temp
temp = temp.next
self.last = temp2
temp2.next = self.root
print('\nDeleted element: ', temp.data)

def printList(self):
"""
Prints all elements in the circular linked list in forward order.
"""
if self.root == None:
print('\nLinked List is empty..!!')
return
temp = self.root
print('\nElements in Linked List are: ')
while True:
print('|', temp.data, '| -> ', end='')
temp = temp.next
if temp == self.root:
break
print('None')
print()


# Main menu-driven code to interact with the linked list.
o = LinkedList()

while True:
print('----------------------')
print('\n1. Insert from Left\n2. Insert from Right\n3. Delete from Left\n4. Delete from Right\n5. Print Linked List\n0. Exit')
print('----------------------')

ch = int(input('\nEnter your choice: '))

if ch == 1:
data = int(input('\nEnter value to be inserted in left: '))
o.insertLeft(data)

elif ch == 2:
data = int(input('\nEnter value to be inserted in right: '))
o.insertRight(data)

elif ch == 3:
o.deleteLeft()

elif ch == 4:
o.deleteRight()

elif ch == 5:
o.printList()

elif ch == 0:
print('You are out of the program..!!')
break

else:
print('\nWrong Input..\nEnter the correct choice..!!\n')
Loading
Loading