list adt specification notes value definitionthe value definition of linked list contains data type for storing the value of the node along with the pointer to the next node the value can be represented using simple data type or collection of basic data types howeverit must necessarily contain at least one pointer to the next structure this can be shown as followsstruct datatype int itemstruct datatype *nextorstruct datatype int itemfloat infochar strstruct datatype *nextdefinition clausethe nodes of the list are all of the same typeand have key field called key the list is logically ordered from smallest unique element of key to the largest value at any position the key of the element is greater than its predecessor and smaller than its successor operations crlistfunctioncreates list and initializes it as empty preconditionsnone postconditionslist is created and is initialized as empty insertfunctioninserts new element into the list either at the beginningin the middle or at the end preconditionsa list already exists postconditionslist is returned with the new element inserted in it deletefunctionsearches list for the element and removes the element from the list preconditionsthe list already exists postconditionsthe list is returned with the element removed from it printfunctiontraverses the list and prints each element preconditionsthe list already exists lovely professional university