TheAlgorithms/Python
1
0
Fork 0
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

Update Linked List from sequence script to use doctests (#12766)

Browse Source 
* Update comments for linked list script.

* Add doctests for the linked list script.

* Update from_sequence.py

---------

Co-authored-by: Maxim Smolskiy <mithridatus@mail.ru>
This commit is contained in:
Mindaugas
2025-08-24 17:48:59 +03:00
committed by GitHub
parent 37b34c2bac
commit d927d67c4a
1 changed files with 27 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
data_structures/linked_list/from_sequence.py
View File

@@ -1,5 +1,7 @@
# Recursive Program to create a Linked List from a sequence and """
# print a string representation of it. Recursive Program to create a Linked List from a sequence and
print a string representation of it.
"""
class Node: class Node:
@@ -18,13 +20,32 @@ class Node:
return string_rep return string_rep
def make_linked_list(elements_list): def make_linked_list(elements_list: list | tuple) -> Node:
"""Creates a Linked List from the elements of the given sequence """
(list/tuple) and returns the head of the Linked List.""" Creates a Linked List from the elements of the given sequence
(list/tuple) and returns the head of the Linked List.
>>> make_linked_list([])
Traceback (most recent call last):
...
ValueError: The Elements List is empty
>>> make_linked_list(())
Traceback (most recent call last):
...
ValueError: The Elements List is empty
>>> make_linked_list([1])
<1> ---> <END>
>>> make_linked_list((1,))
<1> ---> <END>
>>> make_linked_list([1, 3, 5, 32, 44, 12, 43])
<1> ---> <3> ---> <5> ---> <32> ---> <44> ---> <12> ---> <43> ---> <END>
>>> make_linked_list((1, 3, 5, 32, 44, 12, 43))
<1> ---> <3> ---> <5> ---> <32> ---> <44> ---> <12> ---> <43> ---> <END>
"""
# if elements_list is empty # if elements_list is empty
if not elements_list: if not elements_list:
raise Exception("The Elements List is empty") raise ValueError("The Elements List is empty")
# Set first element as Head # Set first element as Head
head = Node(elements_list[0]) head = Node(elements_list[0])
@@ -34,11 +55,3 @@ def make_linked_list(elements_list):
current.next = Node(data) current.next = Node(data)
current = current.next current = current.next
return head return head
list_data = [1, 3, 5, 32, 44, 12, 43]
print(f"List: {list_data}")
print("Creating Linked List from List.")
linked_list = make_linked_list(list_data)
print("Linked List:")
print(linked_list)