public void backward() {
		if (this.current.previous != null) { // If the current node isn't already at the beginning of the list:
			this.current = this.current.previous; // Move it back one node
		}

		else { // If the current node is at the beginning of the list, it can't be move backward
			throw new RuntimeException("No previous node"); // So throw an exception
		}
	}