Doubly Linked List

In doubly linked lists, traversal can be performed?

• a) Only in forward direction

• b) Only in reverse direction

• c) In both directions

• d) In circular fashion

Memory is allocated dynamically to a data structured during execution by -------------

• a) malloc()

• b) calloc()

• c) realloc()

• d) all of the above

Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

• a) Deleting a node whose location in given

• b) Searching of an unsorted list for a given item

• c) Inverting a node after the node with given location

• d) Traversing a list to process each node

What is a memory efficient double linked list?

• a) Each node has only one pointer to traverse the list back and forth

• b) The list has breakpoints for faster traversal

• c) An auxiliary singly linked list acts as a helper list to traverse through the doubly linked list

• d) A doubly linked list that uses bitwise AND operator for storing addresses

Which of the following is false about a doubly linked list?

• a) We can navigate in both the directions

• b) It requires more space than a singly linked list

• c) The insertion and deletion of a node take a bit longer

• d) Implementing a doubly linked list is easier than singly linked list