public Question25() {
list = new LinkedList();
list.insert(1);
list.insert(3);
list.insert(5);
list.insert(7);
list.insert(8);
list.insert(10);
Node entry = list.root;
for (int i = 0; i < 3; i++) entry = entry.next;
Node last = list.root;
while (last.next != null) last = last.next;
last.next = entry;
}
public void remove(Node node) {
Node remove = node;
remove.data = node.next.data;
remove.next = node.next.next;
}
