java数据结构讲述之链表

关于java的链表思想
先可看以下例子
先建立一个实例(Student.java)
package com.yz.mylink;
public class Student {
private Integer id;
private String name;
private Integer age;
private String classes;
public Integer getId() {
return id;
}
public void setId(Integer id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public Integer getAge() {
return age;
}
public void setAge(Integer age) {
this.age = age;
}
public String getClasses() {
return classes;
}
public void setClasses(String classes) {
this.classes = classes;
}
}

建立节点(Node.java)
package com.yz.mylink;
public class Node {
Object data;
Node next;
public Node(Object data){
this.data=data;
next=null;
}
public Object getData() {
return data;
}
public void setData(Object data) {
this.data = data;
}
public Node getNext() {
return next;
}
public void setNext(Node next) {
this.next = next;
}

}

建立调用方法 (Link.java)
 package com.yz.mylink;
public class Link {
Node head;
public Link(){
head=new Node(null);
}

/*
* 追加
*/
public void addNode(Object data){
Node p=head;
while(true){
if(p.getNext()!=null){
p=p.getNext();
}else{
p.setNext(new Node(data));
break;
}
}
}
public void addNode(Integer id,Object data){
Node p=head;
while(true){
if(p.getNext()!=null){
p=p.getNext();
Student stu=(Student) p.getData();
if(stu.getId()==id){
Node mynode=new Node(data);
mynode.setNext(p.getNext());
p.setNext(mynode);
break;
}
}else{
break;
}
}
}

/*
* 删除指定元素
*/
public void delNodestu(Integer id){
Node p=head;
while(true){
if(p.getNext()!=null){
Node pp=p.getNext();
pp=p.getNext();
Student stu=(Student) pp.getData();
if(stu.getId()==id){
p.setNext(p.getNext().