keywords notes circular linked lista linear linked list in which the last element points to the first elementthusforming circle doubly linked lista linear linked list in which each element is connected to the two nearest elements through pointers linear lista one-dimensional list of items linked lista dynamic list in which the elements are connected by pointer to another element nulla constant value that indicates the end of list self assessment choose the appropriate answer pointers permit the referencing of structures in (anormal way (buniform way (ccommon way (dnone recursive data structure is data structure that has the same form regardless of the (asize of the data (bshape of the data (corigin of the data (dform of the data the insert function takes pointer to an existing list as the (asecond parameter (bthird parameter (cfirst parameter (dnone circular linked list has no (abeginning and no mid point (bend and last (cbeginning and beginning (dbeginning and no end fill in the blanks memory allocation in linked lists is linked list stores two items of informationand an function is used to create the list is list of elements in which the elements of the list can be placed anywhere in memory state whether the following statements are true or false we cannot insert node after any specific node in the single linked list each node provides information about where the previous node is in the list linked list is not recursive data structure lovely professional university