Added notebook solving the following: Delete a node in the middle, given only access to that node.

This commit is contained in:
Donne Martin
2015-05-10 13:36:43 -04:00
parent 9ec2b6e28b
commit 1173c51318
2 changed files with 162 additions and 0 deletions

View File

@@ -17,6 +17,7 @@ Continually updated IPython Notebooks containing algorithms and data structures.
* [Linked list with insert, find, delete, and print methods](http://nbviewer.ipython.org/github/donnemartin/algorithms-data-structures/blob/master/linked-lists/linked-list.ipynb)
* [Remove duplicates from a linked list](http://nbviewer.ipython.org/github/donnemartin/algorithms-data-structures/blob/master/linked-lists/remove-duplicates.ipynb)
* [Find the kth to last element of a linked list](http://nbviewer.ipython.org/github/donnemartin/algorithms-data-structures/blob/master/linked-lists/kth-to-last-elem.ipynb)
* [Delete a node in the middle of a linked list, given access to only that node](http://nbviewer.ipython.org/github/donnemartin/algorithms-data-structures/blob/master/linked-lists/delete-mid.ipynb)
## License