data structures using write program to delete node from circular header linked list write program to delete all nodes from header linked list that has negative values in its data part multiple-choice questions linked list is (arandom access structure (bsequential access structure (cboth (dnone of these an array is (arandom access structure (bsequential access structure (cboth (dnone of these linked list is used to implement data structures like (astacks (bqueues (ctrees (dall of these which type of linked list contains pointer to the next as well as the previous node in the sequence(asingly linked list (bcircular linked list (cdoubly linked list (dall of these which type of linked list does not store null in next field(asingly linked list (bcircular linked list (cdoubly linked list (dall of these which type of linked list stores the address of the header node in the next field of the last node(asingly linked list (bcircular linked list (cdoubly linked list (dcircular header linked list which type of linked list can have four pointers per node(acircular doubly linked list (bmulti-linked list (cheader linked list (ddoubly linked list true or false linked list is linear collection of data elements linked list can grow and shrink during run time node in linked list can point to only one node at time node in singly linked list can reference the previous node linked list can store only integer values linked list is random access structure deleting node from doubly linked list is easier than deleting it from singly linked list every node in linked list contains an integer part and pointer start stores the address of the first node in the list underflow is condition that occurs when we try to delete node from linked list that is empty fill in the blanks is used to store the address of the first free memory location the complexity to insert node at the beginning of the linked list is the complexity to delete node from the end of the linked list is inserting node at the beginning of the doubly linked list needs to modify pointers inserting node in the middle of the singly linked list needs to modify pointers inserting node at the end of the circular linked list needs to modify pointers inserting node at the beginning of the circular doubly linked list needs to modify pointers deleting node from the beginning of the singly linked list needs to modify pointers deleting node from the middle of the doubly linked list needs to modify pointers deleting node from the end of circular linked list needs to modify pointers each element in linked list is known as first node in the linked list is called the data elements in linked list are known as overflow occurs when in circular linked listthe last node contains pointer to the node of the list