public void enqueue(T element) {
    	Node<T> node = new Node<T>(element, null);
    	if (top != null) {
    		top.next = node;
    	}
    	this.top = node;
    	if (bottom == null) {
    		bottom = node;
    	}
    }