单链表概念图形:
双链表以及双向循环链表:
单链表实现:
定义存放结点数据和信息的类:
package com.st.datastructure.lineable;
/**
* 单链表的结点
*
*
* @author God's Night Is Not Ended
*/
public class Node {
Object data;//需要存储的数据
Node next;//存放下一个结点
public Node() {
}
public Node(Object data) {
super();
this.data = data;
}
public Node(Object data, Node next) {
super();
this.data = data;
this.next = next;
}
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;
}
}
添加操作:
删除操作: