java单向链表的实现

class link2{
class Node{
private String data;
private Node next;
public Node(String data){
this.data=data;
}
public void add(Node newnode){
if(this.next==null)
this.next=newnode;
else
this.next.add(newnode);

}
public void print(){
System.out.println(this.data);
if(this.next!=null)
this.next.print();
}
public boolean search(String key){
if(this.data.equals(key))
return true;
else{
if(this.next!=null)
return this.next.search(key);
else
return false;
}
}
public void delete(Node pre,String data){
if(this.data.equals(data))
pre.next=this.next;
else{
if(this.next!=null)
this.next.delete(this, data);
else
return;
}
}
};
private Node root;
public void addNode(String data){
Node newnode=new Node(data);
if(root==null)
this.root=newnode;
else{
this.root.add(newnode);
}
}
public void printNode(){
if(this.root==null){
System.out.println("链表为空\n");
System.exit(0);
}
else
this.root.print();
}
public boolean contians(String key){
if(root==null)
return false;
else
return this.root.search(key);
}
public void deleteNode(String data){
if(this.root.data.equals(data))
{
root=this.root.next;
}
else{
if(this.root.next!=null)
this.root.next.delete(root,data);
else
System.out.println("没有此数据\n");
}
}

};

public class Linkdemo1 {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
link2 s1=new link2();
s1.addNode("a");
s1.addNode("b");
s1.addNode("c");
s1.addNode("d");
s1.addNode("e");
s1.printNode();
System.out.println("查找之后\n\n\n\n\n");
System.out.println(s1.contians("x"));
System.out.println("测试删除\n\n\n\n");
s1.deleteNode("f");
s1.printNode();

}

}