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

"Renamed numNodes to num_nodes and decremented num_nodes in delete function

Browse Source
This commit is contained in:
mjk22071998 2024-10-01 16:20:23 +05:00
parent 7cb36dd997
commit c2c9a9e357
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
data_structures/linked_list/sorted_linked_list.py
View File

@ -46,7 +46,7 @@ class SortedLinkedList:
>>> linked_list.head is None >>> linked_list.head is None
True True
""" """
self.numNodes: int = 0 self.num_nodes: int = 0
self.head: Node | None = None self.head: Node | None = None
self.tail: Node | None = None self.tail: Node | None = None
@ -100,7 +100,7 @@ class SortedLinkedList:
temp_node.next_node = new_node temp_node.next_node = new_node
if new_node.next_node is None: if new_node.next_node is None:
self.tail = new_node self.tail = new_node
self.numNodes += 1 self.num_nodes += 1
def display(self) -> None: def display(self) -> None:
""" """
@ -165,7 +165,7 @@ class SortedLinkedList:
self.tail = temp_node self.tail = temp_node
return True return True
temp_node = temp_node.next_node temp_node = temp_node.next_node
self.num_nodes-=1
return False return False
def search(self, data: int) -> bool: def search(self, data: int) -> bool:
@ -241,7 +241,7 @@ class SortedLinkedList:
>>> linkedList.length() >>> linkedList.length()
2 2
""" """
return self.numNodes return self.num_nodes
def min_value(self) -> int | None: def min_value(self) -> int | None:
"""This function will return minimum value """This function will return minimum value