One specialized form of these entities defined over linear data structures is an iterator. The use of postfix iteration on iterators and other versions of these objects relies on the convention that adding an integer to one of these is equivalent to adding the size of the associated type to its value; that convention is the namesake arithmetic of these objects. C-like languages define arrays as a series of these without gaps. The most basic operation on one of objects returns the value of the object to which it of these is associated; that operation is dereferencing. These objects usually hold representations memory locations and that generally indicate where an associated object is stored. 
One specialized form of these entities defined over linear data structures is an iterator. The use of postfix iteration on iterators and other versions of these objects relies on the convention that adding an integer to one of these is equivalent to adding the size of the associated type to its value; that convention is the namesake arithmetic of these objects. C-like languages define arrays as a series of these without gaps. The most basic operation on one of objects returns the value of the object to which it of these is associated; that operation is dereferencing. These objects usually hold representations memory locations and that generally indicate where an associated object is stored. For 10 points, name these objects, the "links" in conventional implementations of linked lists.
One specialized form of these entities defined over linear data structures is an iterator.
{pointers}