First link node of list is accessed from a pointer named

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.
• 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?
• A _____________ list is a list where the last node contains null pointer.
• 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.
• A ______________ list is a header list where the node points back to the header node.
• If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
• __________________ is a header list where the last node contains the null pointer.
• 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.
• In which of the following self – balancing binary search tree the recently accessed element can be accessed quickly?