A linked list is one of the simplest data structures. A linked list element is a record with two fields:

• a link or pointer to the next element ( null in Java or nil in Lisp if there is no next element).

• some contents, as needed for the application. The contents could be a simple item such as a number, or it could be a pointer to another linked list.

In Lisp, a list is written inside parentheses:

(list 'a 'b 'c)         ->   (a b c)

(list (+ 2 3) (* 2 3))  ->   (5 6)

Contents    Page-10    Prev    Next    Page+10    Index