9.3栈和队列（六）——队列

public class MyQuene {

	Node first,last;
	public void enquene(int data){
		if(first==null){
			first=new Node(data);
			last=first;
		}else{
			last.next=new Node(data);
			last=last.next;
		}
	}
	
	public int dequene(){
		if(first!=null){
			int value=first.data;
			first=first.next;
			return value;
		}else
			return -1;
	}

}