- Computer Science Engineering (CSE)
- Data Structure (DS)
- Minimum number of fields in each node of...

Q. |
## Minimum number of fields in each node of a doubly linked list is____ |

A. | 2 |

B. | 3 |

C. | 4 |

D. | None of the above |

Answer» B. 3 |

View all MCQs in:
Data Structure (DS)

- 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.
- If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
- What differentiates a circular linked list from a normal linked list?
- Each Node contain minimum two fields one field called data field to store data. Another field is of type _________.
- Each node in a linked list has two pairs of ………….. and ……………….
- In doubly linked lists
- In doubly linked lists, traversal can be performed?
- In Circular Linked List insertion of a node involves the modification of ____ links.
- In linked list implementation, a node carries information regarding
- A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

Login to Continue

It will take less than 2 minutes

Report MCQ