Jump to content

Doubly-linked list/Definition: Difference between revisions

Doubly-linked list/Definition (view source)

Revision as of 18:08, 27 November 2020

443 bytes removed ,  3 years ago
m
Removed duplicate method from alternative Python implementation.
(Example usage of Python built-in and an alternative Python implementation)
m (Removed duplicate method from alternative Python implementation.)
Line 2,786:
node.next.prev = node.prev
self.size -= 1
 
def _find_node(self, index) -> Node:
if index > self.size - 1 or index < -self.size:
raise IndexError("list index out of range")
 
if index >= 0:
node = self.head
for _ in range(index):
node = node.next
else:
node = self.tail
for _ in range(self.size - 1, self.size - abs(index), -1):
node = node.prev
 
return node
 
def insert(self, index: int, value: Any) -> None:
Jgrprior
140

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/94709"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information