Implementing a singly linked list

[Onra]

Hello,

I wanted to implement a singly linked list with following operations:

Add to end, remove from end, delete everything.

I've already created a ListNode class which's objects contain an element and another ListNode object.

The List class has one field called 'head', which is a ListNode object.

Now for the add method:

public void add(T t){
   if(this.head == null){
      this.head.setElement(t);
   }else{
   }
}

Now the else part is missing and I have no idea.
Can anyone help me?

[m00nchile]

Hello,

I wanted to implement a singly linked list with following operations:

Add to end, remove from end, delete everything.

I've already created a ListNode class which's objects contain an element and another ListNode object.

The List class has one field called 'head', which is a ListNode object.

Now for the add method:

public void add(T t){
   if(this.head == null){
      this.head.setElement(t);
   }else{
   }
}

Now the else part is missing and I have no idea.
Can anyone help me?

public void add(T t){
   if(this.head == null){
      this.head.setElement(t);
   }else{
       ListNode temp = this.head;
       head = new ListNode(t, temp); //assuming ListNode constructor takes data and predecessor
   }
}

[Yuvarajsinh]

class Node
{
int a;
Node n=null;
}
class SLL
{
public static void main(String s[]) throws Exception
{
Node head=new Node();
int i=0,cnt=0;

while(true)
{

System.out.println("\n your choice :");
System.out.println(" 1.add ");
System.out.println(" 2.remove ");
System.out.println(" 3.display ");
System.out.println(" 0.exit");
System.out.print("\n Value : ");
i=System.in.read();System.in.read();System.in.read ();


if(i==48)
break;
if(i==49)
SLL.add(head,++cnt);
if(i==50)
SLL.remove(head);
if(i==51)
SLL.display(head);
}
}
static void display(Node head)
{
Node temp=head;
System.out.print("\n\t SLL is : ");

if(head.n==null && head!=null)
{
System.out.println(head.a);
return;
}
while(temp.n!=null)
{
System.out.print(temp.a+"->");
temp=temp.n;
}
System.out.print("\b\b. ");
}

static void remove(Node head)
{
Node temp=head;
Node t1;

while(temp.n!=null)
{
t1=temp.n;
if(t1.n==null)
{
temp.n=null;
break;
}

temp=t1;
}
if(head.n==null && head!=null)
{
System.out.println("\n\t No element in the list..");
System.exit(0);
}
display(head);
}


static void add(Node head,int cnt)
{
if(cnt==0)
head.a=cnt;
else
{
Node temp=head;
while(temp.n!=null)
{
temp=temp.n;
}

temp.n=new Node();
temp.a=cnt;
}
display(head);

}
}

try this code to run which is complete solution of your problem.