basic linked list questions

[Lindan_newjava]

public class Node  
  {  
       int value;  
       Node next;  
    
       Node(int value, Node next)  
      {  
          this.value = value;  
          this.next = next;  
       }  
    
       Node(int value)  
       {  
          this.value = value;  
       }  
  }  
      class TestNode   
      {  
    
      Node start;  
    
     void method inverse()  //I am confused...:confused:
      {  
         Node p = null;  
         Node q = start;
         for (; q != null; q = q.next)  
         {  
             p = new Node(q.value,p);  
        }  
        start = p;  
      }

.
Question: 1.What does method inverse() do to a general linked list? 2.For a list with n items, what is the maximum number of items that are live during the method inverse()? 3.Give a simple modification of the method inverse() that minimizes the number of live items that necessary for the method to work.

I am new to java, and I am having trouble with the linked list questions above. I see that after calling inverse(), the original list would be in inverse order, like change {1,2,3,4} to {4,3,2,1}. That is to say, we would create a new list, which containing same node values but in inverse order. I am wondering if I follow the question right.
Assume the number of original list items is n. If I follow the first question right, the maximum items that living during the method inverse() would be the n, right? But how to minimizes the number of live items?:confused::confused::confused:

Any tips or suggestions would be greatly appreciated.

[Norm]

What is a "live" item?
Are there other types of items: dead, asleep, moving, ???

[Lindan_newjava]

"live" means accessible from a "head set" of variables.