ListOfEmployee& ListOfEmployee::operator=(const ListOfEmployee& list) {
	EmployeeNode* copy = NULL;
	EmployeeNode* origin = list.head;
	if (this != &list) {  // If lhs and rhs are not equal
		while (head != NULL) { //While head of lhs != null
			deleteMostRecent();
		}

		while (origin != NULL) { // if temp val of rhs is not null
			if (head == NULL) {  // if head of lhs is not is null do following
				head = copy = new EmployeeNode(Employee(origin->getEmp())); // make head(lhs) and copy(lhs) vals both equal to val in origin(rhs)
			}
			else {
				copy->setNext(new EmployeeNode(Employee(origin->getEmp()))); //set the next val of the copy node to current val stored in origin
				copy = copy->getNext(); //copy becomes equal to copys next val
			}
			origin = origin->getNext(); //origin becomes equal to its next va;
		}
	}
	return *this; // return lhs
}