Editing Linked list (section)

==Further reading==
*{{cite web |last=Juan |first=Angel |date=2006 |title=Ch20 –Data Structures; ID06 - PROGRAMMING with JAVA (slide part of the book 'Big Java', by CayS. Horstmann) |url=http://www.uoc.edu/in3/emath/docs/java/ch20.pdf |page=3 |access-date=2011-07-10 |archive-url=https://web.archive.org/web/20120106141608/http://www.uoc.edu/in3/emath/docs/java/ch20.pdf |archive-date=2012-01-06 |url-status=dead |ref=none}}
*{{cite web |last=Black |first=Paul E. |editor1-last=Pieterse |editor1-first=Vreda |editor2-last=Black |editor2-first=Paul E. |date=2004-08-16 |title=linked list |work=Dictionary of Algorithms and Data Structures |publisher=[[National Institute of Standards and Technology]] |url=http://nist.gov/dads/HTML/linkedList.html |access-date=2004-12-14|ref=none}}
*{{cite book |last1=Antonakos |first1=James L. |last2=Mansfield | first2=Kenneth C. Jr. |date=1999 |title=Practical Data Structures Using C/C++ |publisher=Prentice-Hall |isbn=0-13-280843-9 |pages=[https://archive.org/details/practicaldatastr0000anto/page/165 165–190] |url=https://archive.org/details/practicaldatastr0000anto/page/165 |ref=none}}
*{{cite book |last=Collins |first=William J. |date=2005 |orig-year=2002 |title=Data Structures and the Java Collections Framework |publisher=McGraw Hill |location=New York |isbn=0-07-282379-8 |pages=239–303|ref=none}}
*{{cite book |last1=Cormen |first1=Thomas H. |author-link1=Thomas H. Cormen |last2=Leiserson |first2=Charles E. |author-link2=Charles E. Leiserson |last3=Rivest |first3=Ronald L. |author-link3=Ronald L. Rivest |last4=Stein |first4=Clifford |author-link4=Clifford Stein |date=2003 |title=[[Introduction to Algorithms]] |publisher=MIT Press |isbn=0-262-03293-7 |pages=205–213, 501–505|ref=none}}
*{{cite book |last1=Cormen |first1=Thomas H. |author-link1=Thomas H. Cormen |last2=Leiserson |first2=Charles E. |author-link2=Charles E. Leiserson |last3=Rivest |first3=Ronald L. |author-link3=Ronald L. Rivest |last4=Stein |first4=Clifford |author-link4=Clifford Stein |date=2001 |title=[[Introduction to Algorithms]] |edition=2nd |chapter=10.2: Linked lists |publisher=MIT Press |isbn=0-262-03293-7 |pages=204–209|ref=none}}
*{{cite journal |last=Green | first=Bert F. Jr. |date=1961 |title=Computer Languages for Symbol Manipulation |journal=IRE Transactions on Human Factors in Electronics |issue=2 |doi=10.1109/THFE2.1961.4503292 |pages=3–8|ref=none}}
*{{cite journal |last=McCarthy |first=John |author-link=John McCarthy (computer scientist) |date=1960 |title=Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I |journal=[[Communications of the ACM]] |url=http://www-formal.stanford.edu/jmc/recursive.html |doi=10.1145/367177.367199 |volume=3 |issue=4 |page=184|s2cid=1489409 |ref=none|doi-access=free }}
*{{cite book |last=Knuth |first=Donald |author-link=Donald Knuth |date=1997 |title=Fundamental Algorithms |edition=3rd |chapter=2.2.3-2.2.5 |publisher=Addison-Wesley |isbn=0-201-89683-4 |pages=254–298|ref=none}}
*{{cite journal |last1=Newell |first1=Allen |author-link1=Allen Newell |last2=Shaw |first2=F. C. |date=1957 |title=Programming the Logic Theory Machine |journal=Proceedings of the Western Joint Computer Conference |pages=230–240|ref=none}}
*{{cite web |last=Parlante |first=Nick |date=2001 |title=Linked list basics |publisher=Stanford University |url=http://cslibrary.stanford.edu/103/LinkedListBasics.pdf |access-date=2009-09-21|ref=none}}
*{{cite book |last=Sedgewick |first=Robert |author-link=Robert Sedgewick (computer scientist) |date=1998 |title=Algorithms in C |publisher=Addison Wesley |isbn=0-201-31452-5 |pages=[https://archive.org/details/algorithmsinc00sedg/page/90 90–109] |url-access=registration |url=https://archive.org/details/algorithmsinc00sedg/page/90 |ref=none}}
*{{cite book |last=Shaffer |first=Clifford A. |date=1998 |title=A Practical Introduction to Data Structures and Algorithm Analysis |publisher=Prentice Hall |location=New Jersey |isbn=0-13-660911-2 |pages=77–102|ref=none}}
*{{cite journal |last=Wilkes |first=Maurice Vincent |author-link=Maurice Vincent Wilkes |date=1964 |title=An Experiment with a Self-compiling Compiler for a Simple List-Processing Language |journal=Annual Review in Automatic Programming |publisher=Pergamon Press |volume=4 |issue=1 |doi=10.1016/0066-4138(64)90013-8 |page=1|ref=none}}
*{{cite journal |last=Wilkes |first=Maurice Vincent |author-link=Maurice Vincent Wilkes |date=1964 |title=Lists and Why They are Useful |journal=Proceeds of the ACM National Conference, Philadelphia 1964 |publisher=ACM |issue=P–64 |pages=F1–1|ref=none}}
*{{cite web |last=Shanmugasundaram |first=Kulesh |date=2005-04-04 |title=Linux Kernel Linked List Explained |url=http://isis.poly.edu/kulesh/stuff/src/klist/ |access-date=2009-09-21 |ref=none |archive-date=2009-09-25 |archive-url=https://web.archive.org/web/20090925130610/http://isis.poly.edu/kulesh/stuff/src/klist/ |url-status=dead }}