RosettaCodeData/Task/Doubly-linked-list-Traversal/Python/doubly-linked-list-traversal-2.py
2023-07-01 13:44:08 -04:00

5 lines
147 B
Python

l = [ 10, 20, 30, 40 ]
for i in l:
print(i)
for i in reversed(l): # reversed produces an iterator, so only O(1) memory is used
print(i)