We can think of a linked list as a tree. The first node of the list contains the contents of the node, and the rest of the list is a list of the children. The children, in turn, can be lists; a non-list is a leaf node.
(= Y (+ (* M X) B))
Contents    Page-10    Prev    Next    Page+10    Index