Linked List Outputting Issue

[marcchmiel96]

Write your question here.

Hello again, I am having a problem with my linked list outputting zeros instead of inputted values. Can someone check what I did wrong in the add and print fucntions? Will add main.cpp also if needed.

#ifndef __SINGLY_LINKED_LIST__
#define __SINGLY_LINKED_LIST__
#include <iostream>
using namespace std;
struct IntNode
{
	int data;
	IntNode * next;
	IntNode(const int & d = 0, IntNode *n = nullptr) : data(d), next(n) {}
};
class singleListInt
{
public:
	singleListInt() { init(); } //default constructor and only constructor
	~singleListInt() { eraseList(head); } //destructor
	singleListInt(const singleListInt & rhs) { //Copy Constructor {
		eraseList(head);
		init();
		*this = rhs;
	}
void add(int x) { //printing out zeros instead of inputted values.

	IntNode *myNode = new IntNode;
		if (head == nullptr) {
				head = myNode;
		}
		else {
			IntNode *current = head;
			IntNode *prev = 0;
			while (current != nullptr) {
				if (current->data >= myNode->data) {
					break;
				}
				else {
					prev = current;
					current = current->next;
				}
			}
			if (current == head) {
				myNode->next = head;
				head = myNode;
			}
			else {
				myNode->next = current;
				prev->next = myNode;
			}
		}
}

void remove(int x){
	IntNode *current = head;
	IntNode *prev = nullptr;
}
int size() { //To Do: Implement 
	IntNode *number = head->next;
	int i = 0;

	while (number != nullptr) {
		number = number->next;
		i++;
	}
	return i;
}
void print() {
		IntNode *ptr = head->next;
		//To Do: Print list in ascending order with one space between values
//print function not working either
		while (ptr != nullptr) {
			cout << ptr->data << " ";
			ptr = ptr->next;
		}
		cout << endl;
	}
bool contains(const int & x) {
	//To Do: return true x is in list or return false if x is not in list : Done.
	IntNode *current = head;
	while (current != nullptr) {
		if (current->data != x) {
			current = current->next;
		}
		else {
			return true;
		}
		return false;
	}
}
void clearList() {
		eraseList(head);
		init();
		return;
	}
private:
	IntNode *current;
	IntNode *temp;
	void init()
	{
		theSize = 0;
		head = new IntNode;
		head->next = nullptr;
	}
	void eraseList(IntNode * h)
	{
		//To Do: remove all the nodes in the list

	};
	IntNode *head;
	int theSize;
};
#endif