链表简单实现
```java
class Node<T>{
T name;
public Node(T name, Node next, Node previdous) {
this.name = name;
this.next = next;
this.previdous = previdous;
}
Node<T> next;
Node<T> previdous;
@Override
public String toString() {
return "Node{" +
"name='" + name + '\'' +
'}';
}
}
*节点的实现
public class MyLinkedList<T> implements Iterable<T>{
private int theSize;
private int modCount;
private Node<T> beginMarker;
private Node<T> endMarker;
public MyLinkedList(){
clear();
}
public void clear(){
beginMarker=new Node<T>(null,null,null);
endMarker=new Node<T>(null,beginMarker,null);
beginMarker.next=endMarker;
theSize=0;
modCount++;
}
public int size(){
return theSize;
}
public boolean