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

Corrected doctests

Browse Source
This commit is contained in:
mjk22071998 2024-10-01 15:49:07 +05:00
parent 36480f4c27
commit 3ab0f7e585
1 changed files with 6 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
data_structures/linked_list/sorted_linked_list.py
View File

@ -116,7 +116,7 @@ class SortedLinkedList:
>>> linkedList.insert(57)
>>> linkedList.insert(45)
>>> linkedList.display()
32 45 57
32 45 57
"""
temp: Optional[Node] = self.head
while temp:
@ -144,11 +144,11 @@ class SortedLinkedList:
>>> linkedList.insert(57)
>>> linkedList.insert(45)
>>> linkedList.display()
32 45 57
32 45 57
>>> linkedList.delete(45)
True
>>> linkedList.display()
32 57
32 57
"""
if self.head is None:
return False
@ -211,7 +211,6 @@ class SortedLinkedList:
>>> linkedList.insert(32)
>>> linkedList.insert(57)
>>> linkedList.insert(45)
>>> linkedList.search(45)
>>> linkedList.is_empty()
False
"""
@ -297,10 +296,10 @@ class SortedLinkedList:
>>> linkedList.insert(45)
>>> linkedList.insert(45)
>>> linkedList.display()
32 45 45 57
32 45 45 57
>>> linkedList.remove_duplicates()
>>> linkedList.display()
32 45 57
32 45 57
"""
temp: Optional[Node] = self.head
@ -328,7 +327,7 @@ class SortedLinkedList:
>>> linkedList2.insert(95)
>>> linkedList.merge(linkedList2)
>>> linkedList.display()
23 32 45 47 57 95
23 32 45 47 57 95
"""
if other_list.head is None:
return