Name this type of data structure in which each node contains two fields, one containing the value and the other containing the location of the next value.
These are the basic data structure in Lisp, and in many functional languages, are implemented via cons [KAHNZ] cells, each with a head and tail. They do not support efficient indexing, but do have faster insertion and deletion than arrays, and need not be contiguous in memory. These structures can be classified as "single-" or "doubly-", and they also can be classified as "linearly" or "circularly". Name this type of data structure in which each node contains two fields, one containing the value and the other containing the location of the next value.
These are the basic data structure in Lisp, and in many functional languages, are implemented via cons [KAHNZ] cells, each with a head and tail.
{linked lists} [do not accept partial answers]