Which of the following is true while inserting a new node in the list?

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.
• 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________.
• A ______________ list is a header list where the node points back to the header node.
• What is the worst case time complexity of inserting a node in a doubly linked list?
• To insert a new node in linked list free node will be available in ___________.
• 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.
• 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 points back to the header node.
• What is the functionality of the following code? Choose the most appropriate answer. public int function() { if(head == null) return Integer.MIN_VALUE; int var; Node temp = head; Node cur; while(temp.getNext() != head) { cur = temp; temp = temp.getNext(); } if(temp == head) { var = head.getItem(); head = null; return var; } var = temp.getItem(); cur.setNext(head); return var; }