Works on mac but not working on windows

[YikUTM]

Hi, everyone. I am trying to convert infix to postfix using linked list, class and stacks. This program can be compiled on mac and windows but it cannot work properly on windows. It works fine on mac. I can't find the reason. Please help.

#include <iostream>
using namespace std;

class Node
{
public:
	char alpha;
	Node* next;
};

class Stack
{
private:
	Node* top;

public:
	void createStack();
	void push(char n);
	Node* pop();
	void display()
	{
		Node* curr = top;
	while(curr != NULL)
	{
		cout << curr -> alpha << ",";
		curr = curr -> next;
	}
	cout <<endl;
	}

	bool isEmpty()
	{
		return (top == NULL);
	}

	Node* stacktop()
	{
		return top;
	}
};

class List
{
public:
	Node* head;
	Node* tail;

	void addnode(char n);
	void displaynode();
};

void List::displaynode()
{
	cout << "display "<<endl;
	Node* curr = head;
	while(curr != NULL)
	{
		cout << curr -> alpha;
		curr = curr -> next;
	}
	cout<<endl;
}

void List::addnode(char n)
{
	Node* curr = head;
	Node* prev = NULL;
	Node* newnode = new Node;
	newnode -> alpha = n;
	while(curr != NULL)
	{
		prev = curr;
		curr = curr -> next;
	}

	if(head == NULL)
	{
		head = newnode;
		tail = newnode;
	}
	else
	{
		prev -> next = newnode;
		tail = newnode;
	}
	cout << "newnode : "<<newnode -> alpha<<endl;
}

void Stack::createStack()
{
	top = NULL;
}

void Stack::push(char n)
{
	Node* newnode = new Node;
	newnode -> alpha = n;

	newnode -> next = top;
	top = newnode;
}

Node* Stack::pop()
{
	Node* del = top;
	cout << "pop : "<< del -> alpha <<endl;
	top = top -> next;
	return del;
	//delete del;
	//cout << "top : "<< top -> num <<endl;
}

int precede(char n)
{
	if(n == '+' || n=='-')
		return 1;
	else if(n == '*' || n== '/')
		return 2;
	//else if(n=='#')
	//	return 3;

}


int main()
{
	Stack stack;
	List list;
	char input[10];
	cin >> input;
	int i=0;
	char popchar;
	stack.createStack();
	stack.push('#');

	//cout << "precede : "<< precede('#')<<endl;
	while(input[i]!='\0')
	{
		if(input[i] >= '0' && input[i] <= '9'
			|| input[i] >= 'a' && input[i] <= 'z')
		{
			cout<<"num"<<endl;
			list.addnode(input[i]);
		}

		else if(input[i] == '+' ||
			input[i] == '-' ||
			input[i] == '*' ||
			input[i] == '/')
		{
			cout<<"char"<<endl;
			while(!stack.isEmpty() &&
				precede(stack.stacktop() -> alpha)>=precede(input[i]))
			{
				cout << "stktop : "<<stack.stacktop()->alpha<<endl;
				cout << "p(stktop) : "<<precede(stack.stacktop() -> alpha) <<endl;
				cout << "input [i] : "<<input[i]<<endl;
				cout << "p(input[i]) : "<<precede(input[i])<<endl;
				cout <<"ppp"<<endl;
				popchar = stack.pop() -> alpha;
				list.addnode(popchar);
			}

			stack.push(input[i]);
			cout <<"push : "<<input[i]<<endl;
		}

		
		i++;
	}
	char ppchar;
	while(stack.stacktop()->alpha != '#')
		{
			ppchar = stack.pop() -> alpha;
			cout << "pops : "<< ppchar<<endl;
			list.addnode(ppchar);
		}


	list.displaynode();

	return 0;
}

[mzimmers]

You’re more likely to get good help if you would be more specific about how it doesn’t work.