Java实现链表

class Link
{
private Node head;
public Link(Node head)
{
this.head=head;
}
public void addNode(Node node)
{
Node p=head;
while(true)
{
if(!p.hasNext())
{
p.setNext(node);
break;
}
p=p.getNext();
}
}
//插入节

public void insertNode(Node p,Node q)
{
q.setNext(p.getNext());
p.setNext(q);
}
//删除节点
public boolean delNode(Object nodeName)
{
Node p=head;
if(!p.hasNext())
{
System.out.println("此表为空");
return false;
}
while(p.hasNext())
{
if(p.getNext().getName().equals(nodeName))
{
p.setNext(p.getNext().getNext());
break;
}
p=p.getNext();
}
return true;
}
//遍历链表
public void display()
{
Node p=head.getNext();
while(p.hasNext())
{
System.out.println(p.getName());
p=p.getNext();
}
}
}