Doubly Linked Lists

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

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

In which list user can navigate in both direction?

• Singly Linked List

• Doubly Linked List

• Both

A node in a doubly linked list has at least _____ fields

• 4

• 2

• 3

• 5

The DATA field of the head node will usually contain information.

• True

• False

It use pointer to link nodes.

• Variable

• Link List

• Pointer

• Trees

• circular linked list

• linked list

• doubly circular linked list

• doubly linked list

In ___________ data structure data items are not in sequence.

• non linear

• linear

• non-homogeneous

• all of above

What type of linkedlist is represented in the image

• singly linkedlist

• doubly linkedlist

• circular singly linkedlist

• circular doubly linkedlist

What type of application is represented by the image

• Polynomial arithmetic

• radix sort

• Multilists

• None