//Doubly lnked list question:

public class Deque {

Node first = null; Node last = null; int N = 0; //initializes an empty queue here static class Node { public Node() { } public int item; public Node next; public Node prev; }

public boolean isEmpty () { //simply return 0 when empty //if (N==0) //already what is being tested for; return (N==0) ; //empty when N=0;//remember this is giving us true || false; } public int size () { return N; }

public int delete (int k) { //Code here: Delete node which contains int k return 0; }