Minimum number of fields in each node of a doubly linked list is____

Related MCQs

• 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.
• In linked list each node contain minimum of two fields. One field is data field to store the data second field is?
• What is the worst case time complexity of inserting a node in a doubly linked list?
• A linked list whose last node points back to the list node instead of containing the null pointer________.
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• Which of the following is false about a doubly linked list?
• If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
• To insert a new node in linked list free node will be available in ___________.
• Each node in a singly linked lists have ______ fields
• What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?