i learnt this

This is a simple implementation of linked list in java.  ===== package collections; public class LinkedListMyImpl { Node startNode; Node endNode; void add(int i){ if(startNode == null){ Node n = new Node(); n.i = i; startNode = n; }else{ Node n = new Node(); n.i = i; if(endNode == null){ startNode.nextNode = n; endNode = n; endNode.previousNode = startNode; }else{ endNode.nextNode = n; n.previousNode = endNode; endNode = n; } } } void remove(int i){ Node n = startNode; while( n != null){ if(n.i == i){ Node previousNode = n.previousNode; Node nextNode = n.nextNode; if(previousNode != null) previousNode.nextNode = nextNode; if(nextNode != null) nextNode.previousNode = previousNode; n = null; break; } if(n.nextNode != null) n = n.nextNode; } } void print(){ Node n = startNode; while( n != null){ System.out.pri