mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-04-29 20:26:07 -04:00
Update README.md
This commit is contained in:
parent
8a30000724
commit
937183da0c
@ -2,6 +2,14 @@
|
||||
|
||||
<br>
|
||||
|
||||
* 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).
|
||||
|
||||
|
||||
<br>
|
||||
|
||||
----
|
||||
|
||||
### `LinkedListFIFO.py`
|
||||
|
||||
<br>
|
||||
|
Loading…
x
Reference in New Issue
Block a user