数据链表实例（递归）

public class TestNodes {
	public static void main(String[] args){
		NodeManager nm = new NodeManager();
		nm.addNode("1");
		nm.addNode("2");
		nm.addNode("3");
		nm.addNode("4");
		nm.printNode();
		nm.delNode("2");
		nm.printNode();
	}
}

class NodeManager{
	Node root;//根节点
	//新增节点
	public void addNode(String name){
		if(root==null){
			root=new Node(name);
		}else{
			root.add(name);
		}
	}
	//删除节点
	public void delNode(String name){
		if(root.getName().equals(name)){
			root=root.next;
		}else{
			root.del(name);
		}
	}
	//打印节点
	public void printNode(){
		if(root!=null){
			System.out.print(root.getName() + "->");
		}
		root.print();
		System.out.println();
	}
	
	class Node{
		private String name;
		private Node next;
		
		public Node(String name){
			this.name=name;
		}
		
		public String getName(){
			return this.name;
		}
		
		//添加节点
		public void add(String name){
			if(this.next==null){
				this.next=new Node(name);
			}else{
				this.next.add(name);
			}
		}
		//删除节点
		public void del(String name){
			if(this.next.getName().equals(name)){
				this.next=root.next.next;
			}else{
				this.next.del(name);
			}
		}
		//打印节点
		public void print(){
			if(this.next!=null){
				System.out.print(this.next.getName() + "->");
				this.next.print();
			}
		}
	}
}