For 10 points name this type of list which in which each data entry is associated with a pointer to the next item in the list.
The CAR and CDR operators work on this data structure. It's not a tree, but this structure may include sentinel nodes. It can be used to implement a stack efficiently since inserting and removing the first element takes constant time. In the worst case it will take Big-O of n time to insert and remove elements from an n-element instance of this data structure. For 10 points name this type of list which in which each data entry is associated with a pointer to the next item in the list.
The CAR and CDR operators work on this data structure. It's not a tree, but this structure may include sentinel nodes.
{linked} list [prompt on {list}; or {free list} before "{circular}" is read]