双向循环链表的实现

首先，声明一个类及其方法

package com.shengsiyuan;

public class Node2
{
    Node2 previous;
	String data;
    Node2 next;
    
    public Node2(String data)
    {
    	this.data = data;
    }
}

双向循环链表的实现：

package com.shengsiyuan;

public class NodeTest2
{
  public static void main(String[] args)
{
	Node2 node1 = new Node2("node1");
	Node2 node2 = new Node2("node2");
	Node2 node3 = new Node2("node3");
	Node2 node4 = new Node2("node4");
	
	node1.next  = node2;
	node2.previous = node1;
	
	node2.next = node3;
	node3.previous = node2;
	
	node3.next = node1;
	node1.previous = node3;
	
	System.out.println(node1.next.data);
	System.out.println("------------------");
	
	node1.next  = node4;
	node4.previous = node1;
	
	node4.next = node2;
	node2.previous = node4;
	
	node2.next = node3;
	node3.previous = node2;
	
	node3.next = node1;
	node1.previous = node3;
	
	System.out.println(node1.next.next.data);
	System.out.println("------------------");
	node1.next = node2;
	node2.previous = node1;
	node4.next = null;
	node4.previous = null;
	
	System.out.println(node1.next.data);
}
}

代码运行结果：