notes postconditionslist elements are printed in the order they are present in the list list remains unchanged modifyfunctionsearches for an element and replaces it with new value preconditionsthe list already exists postconditionsthe element if present is modified by new value these are the basic set of operations that might be needed to create and maintain list of elements other operationswhich can be performed on linked listsare counting the elements in list concatenating two lists users can think of more operations like comparing two listsadding the elements of two listsetc depending on specific problem and try building adt' of their own implementation each element of the list is called node and consists of two or more members some members can contain the information pertaining to that node and the others may be pointers to other nodes in case of singly linked listone member consists of such pointer linked list is therefore collection of structures ordered not by their physical placement in memory but by logical links that are stored as part of data in the structure itself the link is in form of pointer to another structure of the same type such structure is represented in ' / ++as followsstruct node int itemstruct node *next}the first member is an integer item and the second pointer to the next node in the list as shown the item can be any complex data type that is it can contain collection of basic data types furtheras we will study doubly linked lists laterwe can have more than two pointers onepointing to the successor node and the other to the predecessor the pointer type is the type of the node itself this node can be shown as followsstruct node int itemfloat infochar strstruct node *next}right nowwe will limit our discussion to singly linked lists with only two membersi one containing the data and the other pointer to the next node lovely professional university