The pointer of the last node contains a special value called_____________.

Related MCQs

• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• A _____________ list is a list where the last node contains null pointer.
• __________________ is a header list where the last node contains the null pointer.
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• A linked list whose last node points back to the list node instead of containing the null pointer________.
• _______________is a header list where the last node points back to the header node.
• In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
• A linear collection of data elements where the linear node is given by means of pointer is called?
• First link node of list is accessed from a pointer named
• To insert element at start, the previous pointer of newly added node would point to ______