@Override
	public void addToBack(E x) {
		if (this.head == null) { // If the list is empty:
			this.head = new Node(x, null, null); // Create a new Node for the head without any previous or next nodes
			this.tail = this.head; // If there is only one node in the list, the tail of the list equals the head
			this.current = this.head; // Set the current node to this.head because it is the only node in the list
		}

		else { // Otherwise:
			this.tail = new Node(x, this.tail, null); // Create a new node with the element passed to the function as the data, the previous tail as the previous node, and no next node
			this.tail.previous.next = this.tail; // Set the next attribute of the node before the tail node to the new tail node
		}

	}