c++ Dijkstra's algorithm

[t2nator]

I can't seem to get the order correct on this program, it uses an algorithm to convert infix to postfix:

ItoP.cpp

#include "ItoP.h"
int main() {
	string input;
	getline(cin,input);
	ItoP Conl;
	Conl.Convert(input); 
	return 0;
}

ItoP.h

#include <iostream>
#include <fstream> 
#include <string>
#include <stack>
using namespace std; 

class ItoP {
public:
	string Convert(string);
	ItoP();
	
private:
	stack<string> mystack;
	string postfix; 
	string infix;
	string operate; 
	char token; 
};
ItoP::ItoP() {
}
string ItoP::Convert(string inData) {
	for(int i=0;i<=inData.length();i++) {
		operate.clear();
		token = inData[i];
		operate += token;
		switch(inData[i]) {
		case'0': case'1': case'2': case'3': case'4':
		case'5': case'6': case'7': case'8': case'9':
			cout << inData[i]; //If current char is integer then output
			break;
		default:
		if(token == '(') {
			mystack.push(operate); 
			break;
		}
		else
			if(token == ')') {
				while(mystack.top() != "(") {
					cout << mystack.top();
					mystack.pop();
				}
				mystack.pop();
				break;
			}
			else
				if(mystack.empty()) {
					mystack.push(operate); 
					break;
				}
				else
					while(!mystack.empty() && operate <= mystack.top()) {
						cout << mystack.top();
						mystack.pop();
					}
					mystack.push(operate);
					break;
		} //End switch
		 
	}
		
	while(!mystack.empty()) {
		cout  << mystack.top();
		mystack.pop();
	}
	cout << endl;
	return postfix; 
}

Input:

2+3*5

Output:

23*5+

Expected output:

235*+