//Need help with deques pushleft and pushright

public class MyDeque {

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 () { return (N==0) ; } public int size () { return N; } public void pushLeft (int item) { if(N==0) { first= newNode; N++; } } public void pushRight (int item) { //code here

}