JAVA 堆栈和队列的模拟

第一次写东西，刚自己练练手模拟了下堆栈和队列的的类，希望能给自己一点点激励。以后希望自己能多写点JAVA和JAVASCRIPT的东西在这上面，也是希望能和大家多多交流，互相进步。
堆栈：

    public class LinkedStack<T> {
	private static class Node<U>{
		U item;
		Node<U> next;
		Node(){
			this.item=null;
			this.next=null;
		}
		Node(U item,Node<U> next){
			this.item=item;
			this.next=next;
		}
		boolean end(){return this.item==null&&this.next==null;}
	}
	private Node<T> top=new Node<T>();
	/*
	 * 放进元素
	 */
	public void push(T item){
	  top=new Node(item,top);
	}
	/*
	 * 取出元素
	 */
	public T pop(){
		T item=top.item;
		if(!top.end()){
			top=top.next;
		}
		return item;
	}
}

队列：

public class MyQueue<T>{
	private static class Node <U>{
		U item;
		Node<U> previous;
		Node(){
			this.item=null;
			this.previous=null;
		}
		Node(U item,Node<U> previous){
			this.item=item;
			this.previous=previous;
		}


		boolean end(){return this.previous==null;}
	}
	private Node<T> bottom=new Node<T>();
	private int length=0;
          /*
	 * 放进元素
	 */
	public void push(T item){
		if(length==0){
			this.bottom.item=item;
			length++;
		}else{
			Node<T> node =new Node<T>(item, null);
			Node<T> top=this.bottom.previous;
			if(top==null){
				this.bottom.previous=node;
			}else{
			Node<T> next=null;	
			while(top!=null){
				next=top;
				top=top.previous;
			}
			next.previous=node;
		 }
		}
	}
          /*
	 * 取出元素
	 */
	public T pop(){
	T item=bottom.item;
	if(!bottom.end()){
		this.bottom=bottom.previous;
	}
	return item;
 }
}