First link node of list is accessed from a pointer named

Related Questions

• 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 ?
• In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
• To insert element at start, the previous pointer of newly added node would point to ______
• How do you calculate the pointer difference in a memory efficient double linked list?
• if there are no nodes in linked list then start pointer will point at which value?
• Which is the pointer associated with the availability list?
• Any node is the path from the root to the node is called
• node.next -> node.next.next; will make
• 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; }