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

Fix bug for data_structures/linked_list/doubly_linked_list_two.py (#12651)

Browse Source 
* Fix bug for data_structures/linked_list/doubly_linked_list_two.py

* Fix

* Fix

* Fix

* Fix

* Fix

* Fix

* Fix

* Update doubly_linked_list_two.py

* Update doubly_linked_list_two.py

* Update doubly_linked_list_two.py

* Update doubly_linked_list_two.py

* Update doubly_linked_list_two.py

* Update doubly_linked_list_two.py

* Update doubly_linked_list_two.py

* Update doubly_linked_list_two.py

* Update doubly_linked_list_two.py

* Update doubly_linked_list_two.py

* Update doubly_linked_list_two.py

* Update doubly_linked_list_two.py
This commit is contained in:
Maxim Smolskiy 2025-04-02 10:23:55 +03:00 committed by GitHub
parent baab802965
commit 0c8cf8e987
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 21 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
data_structures/linked_list/doubly_linked_list_two.py
View File

@ -81,8 +81,9 @@ class LinkedList:
self.insert_before_node(self.head, node) self.insert_before_node(self.head, node)
def set_tail(self, node: Node) -> None: def set_tail(self, node: Node) -> None:
if self.head is None: if self.tail is None:
self.set_head(node) self.head = node
self.tail = node
else: else:
self.insert_after_node(self.tail, node) self.insert_after_node(self.tail, node)
@ -104,9 +105,7 @@ class LinkedList:
node.previous = node_to_insert node.previous = node_to_insert
def insert_after_node(self, node: Node | None, node_to_insert: Node) -> None: def insert_after_node(self, node: Node, node_to_insert: Node) -> None:
assert node is not None
node_to_insert.previous = node node_to_insert.previous = node
node_to_insert.next = node.next node_to_insert.next = node.next
@ -127,7 +126,7 @@ class LinkedList:
return return
current_position += 1 current_position += 1
node = node.next node = node.next
self.insert_after_node(self.tail, new_node) self.set_tail(new_node)
def get_node(self, item: int) -> Node: def get_node(self, item: int) -> Node:
node = self.head node = self.head
@ -237,6 +236,22 @@ def create_linked_list() -> None:
7 7
8 8
9 9
>>> linked_list = LinkedList()
>>> linked_list.insert_at_position(position=1, value=10)
>>> str(linked_list)
'10'
>>> linked_list.insert_at_position(position=2, value=20)
>>> str(linked_list)
'10 20'
>>> linked_list.insert_at_position(position=1, value=30)
>>> str(linked_list)
'30 10 20'
>>> linked_list.insert_at_position(position=3, value=40)
>>> str(linked_list)
'30 10 40 20'
>>> linked_list.insert_at_position(position=5, value=50)
>>> str(linked_list)
'30 10 40 20 50'
""" """