determined by the chain of next links going from each node to its successor in the list unlike an arraya singly linked list does not have predetermined fixed sizeand uses space proportional to the number of its elements likewisewe do not keep track of any index numbers for the nodes in linked list so we cannot tell just by examining node if it is the secondfifthor twentieth node in the list implementing singly linked list to implement singly linked listwe define node classas shown in code fragment which specifies the type of objects stored at the nodes of the list here we assume elements are character strings in we describe how to define nodes that can store arbitrary types of elements given the node classwe can define classslinkedlistshown in code fragment defining the actual linked list this class keeps reference to the head node and variable counting the total number of nodes code fragment singly linked list implementation of node of code fragment partial implementation of the class for singly linked list