mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-20 04:37:36 +00:00
Code Issues Packages Projects Releases Wiki Activity

Corrected errors in ruff test

Browse Source
This commit is contained in:
mjk22071998 2024-10-01 13:12:39 +05:00
parent 0a1c71e34d
commit 4ae57dc896
1 changed files with 7 additions and 8 deletions

15
data_structures/linked_list/sorted_linked_list.py

@ -1,6 +1,5 @@
from __future__ import annotations
from collections.abc import Iterator
from dataclasses import dataclass
"""
@ -17,7 +16,7 @@ class Node:
def __repr__(self):
return f"Node({self.data}, {self.next_node})"
class SortedLinedList:
class SortedLinkedList:
def __init__(self):
self.numNodes : int = 0
self.head: Node | None = None
@ -191,7 +190,7 @@ class SortedLinedList:
if __name__ == "__main__":
linkedList=SortedLinedList()
linked_list=SortedLinkedList()
while True:
print("Enter")
print("1. Insert")
@ -202,15 +201,15 @@ if __name__ == "__main__":
if choice == '1':
data = int(input("Enter a number: "))
linkedList.insert(data)
linked_list.insert(data)
elif choice == '2':
linkedList.display()
linked_list.display()
elif choice == '3':
data = int(input("Enter the data to delete: "))
if linkedList.delete(data):
print("Node with data {} deleted successfully".format(data))
if linked_list.delete(data):
print(f"Node with data {data} deleted successfully")
else:
print("Node with data {} not found in the list".format(data))
print(f"Node with data {data} not found in the list")
elif choice == '4':
break
else: