Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-05-22 08:21:12 -04:00
Code Issues Projects Releases Packages Wiki Activity
master-algorithms-py/linked_lists
History
marina 67656b197d
Update detect_cycle.py
2023-08-02 16:40:19 -07:00
..
detect_cycle.py Update detect_cycle.py 2023-08-02 16:40:19 -07:00
double_linked_list.py Rename linked_list-double.py to double_linked_list.py 2023-07-31 12:00:43 -07:00
linked_list_fifo.py Rename LinkedListFIFO.py to linked_list_fifo.py 2023-07-31 11:59:00 -07:00
linked_list_II.py Create linked_list_II.py 2023-08-02 16:31:26 -07:00
merge_two_lists.py Create merge_two_lists.py 2023-07-31 13:44:12 -07:00
README.md Update README.md 2023-07-29 20:34:26 -07:00
reverse_linked_list.py Create reverse_linked_list.py 2023-07-31 12:21:30 -07:00
swap_every_two_nodes.py Create swap_every_two_nodes.py 2023-07-31 12:00:18 -07:00

README.md

Linked List


  • unlike an array, a list does not provide constant time access to an index (as it needs to interact through all k elements), however addition and removal of elements are constant time.
  • to remove a node you set prev.next equal to node.next. if it's a double list, you also update node.next with node.next.prev to node.prev (and deallocate the memory).

LinkedListFIFO.py


python LinkedListFIFO.py

Linked List FIFO
Add 1: None
Add 2: Nonew
Add 3: None
Length: 3
Find 1: (None, None, 0)
Delete 1: None
Length: 0
Find 1: (None, None, 0)