Have difficulties on linked list...anyone can help???

Question

import java.util.Random;
     class node{
          private int key;
          private node next;
//a constructor that takes in an int x for assigning x to key and next to null
          public node(int x)     {
                    key=x;
                    next=null;
//a method SetKey that takes in an int x that it replaces the value in key with x.
          public void SetKey(int x){key=x;}
//a method GetKey that returns the value in key
          public int GetKey() {return key;}
//a method GetNext that returns the next node
          public node GetNext() {return next;}
//a method SetNExt that takes in a type node NewNode
//and it connects current node to NewNode
          public void SetNext(node NewNode){NewNode.next=NewNode;}
}//end node class
     class singlelist{
     private node list;
     private int NodeSize;
//a constructor that takes in no parameter and it initializes
//the list to null and NodeSize to value 0.
          public singlelist()
               {list = null;
               NodeSize = 0;
//a constructor that takes in an int x for storing x
//onto the firstnode referenced by the list and the NodeSize holds
//a value 1
          public singlelist(int x) {list = new node(x);
                    NodeSize = 1;
//a Method PrintNode that prints all the contents in the list.
          public void PrintNode()
               node cur;
               for(cur=list;cur!=null;cur=cur.GetNext())
               System.out.println("The node is " + cur.GetKey());
//a method JoinNewnNode that takes in an int x
//which places onto a newnode and this node is connected to
//the end of the list. It increase the NodeSize by 1.
          void JoinNewNode(int x){node temp=new node(x);
                    list.SetNext(temp);
                    NodeSize=2;
//a method named AddNewItem that takes in an int x and
//it includes at the beginning of list type node; it reports an error
//otherwise
          void AddNewItem(int x) {
                    node temp = new node(x);
                    if (temp != null) {
                         temp.SetNext(list);
                         list = temp;
                         NodeSize++;}
                    else
                         System.out.println("Unsuccessful to create a node");
//a method RecPrint that takes in no parameter and it
//message a private recursive method RecPrint that takes in an object intlist of type
//node. It prints the last node first till it reaches to the first node. The
//integers are placed horizontally
          public void RecPrint() {
               System.out.println("The integers in the list are : ");
                    RecPrint(list);
               System.out.println(" ");}
          private void RecPrint(node intlist){
               if (intlist!=null){
                    RecPrint(intlist.GetNext());
               System.out.print(" " + intlist.GetKey());
          public void CountEven()
               {System.out.println("Number of evens : " + CountEven(list));
//a recursive method CountEven that takes in countlist of type node
//it returns an int saying number of even; otherwise a value 0
          public int CountEven(node countlist)
          int count;
          if (countlist==null)return 0;
               else
                    count = CountEven(countlist.GetNext());
               if (countlist.GetKey() % 2==0)
                    return (count+1);
               else
                    return count;
//an iterative method Range that takes no value and it prints
//the minimum and maximum int.
          public void Range() {
               int max,min;
               max = min = list.GetKey();
          for (node curptr = list.GetNext(); curptr != null; curptr = curptr.GetNext())
               {if (max < curptr.GetKey()) max = curptr.GetKey();
          if (min > curptr.GetKey()) min = curptr.GetKey();}
          System.out.println(" Max =" + max + "Min =" + min);
//a method to delete the node
          public void DeleteNode(int x) {
               node p = new node(null);
               node cur = list;
          if(cur == null) {
               System.out.println("Error: attempting to delete an empty list!");
          else {
               boolean found = false;
               while (cur != null) {
          if (cur.data == x) {
               found = true;}
          class listapp{
               public static void main(String [] args)
               singlelist linkedlist=new singlelist(30);
               singlelist oddlist = new singlelist();
               Random rand = new Random();
               for(int x=0; x<10; x++)
                    linkedlist.AddNewItem((int)(Math.floor(99*rand.nextFloat() + 2)));
                    linkedlist.PrintNode();
               System.out.println("Total Odd is " + TakeOdd(linkedlist,oddlist));
               oddlist.RecPrint();
               linkedlist.CountEven();
               linkedlist.Range();
//a public static method TakeOdd that takes in two obj or type singllist which
//are slist and oddlist. The slist holds int chained 2gether and oddlist, on exit
//contains odd int from slist. It returns an int identifying total odds     
     public static int TakeOdd(singlelist slist, singlelist oddlist)
     int temp;
     singlelist templist = new singlelist();
     while(slist.ReturnNode() != null)
          {temp=slist.DeleteNode();
     if(temp%2 !=0)     oddlist.AddNewItem(temp);
     templist.AddNewItem(temp);
     for (templist.ReturnNode()!=null; slist.AddNewItem(templist.DeleteNode()));
     return oddlist.GetNodeSize();
}//end singlelist class

Answer 1

there's a lot of code here and you don't even
say what the problem is. one thing that jumps
out thou is your SetNext() method:
public void SetNext(node NewNode){NewNode.next=NewNode;}which i would guess should be:
{next=NewNode;}jonesy (Sun Developer Support)