McqMate

Q. |
## 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 |

Answer» D. Implementing a doubly linked list is easier than singly linked list |

4k

0

Do you find this helpful?

31

View all MCQs in

Data Structures (DS)No comments yet

- Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
- What is the worst case time complexity of inserting a node in a doubly linked list?
- Minimum number of fields in each node of a doubly linked list is____
- What differentiates a circular linked list from a normal linked list?
- What differentiates a circular linked list from a normal linked list?
- In doubly linked lists
- In doubly linked lists, traversal can be performed?
- The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
- Which of the following is false about a circular linked list?
- A _________is a linked list which always contains a special node called the header node, at the beginning of the list.