Loop a Linked List
In the following code snippet, assume the variable node is a node in a singly linked list, and the list contains nodes with the following data: [ 1, 2, 3, 4, 5, 8, -2 ] ... while(node.getNext().getNext() != null){ node = node.getNext() } What will the value of node represent? And how many loops will it take to get there?


Answers are hidden from search engines.
linked-lists datastructure multichoice language=java