letterG

Hi all! I've just started working on my Binary Search Tree and already there's a problem that I can't seem to understand. Ok here's the problem, when I compile its ok but when I run it there's an error, i've managed to found where the problem is but I don't …

I'm stuck at comparing the operators, it seems I can only compare the current operator to the topmost of the stack, how do I keep on comparing it til the stack is null or the precedence don't hold true anymore?...i've commented the part where I think my program fails...any help? …

Hi again, I ran to some problems in input some codes but i'm quite sure that my code is correct but the output is not what I expect it to be, this is my code: #include<iostream> #include<string> #include<sstream> using namespace std; struct movie{ string title; int year; }; struct info{ …

Hi new member here! i'm having a problem with my code here but I really don't know why, its in the line where i'll comment.. #include<iostream> using namespace std; void convert(char*); void main(){ char r, sen[200]; do{ cout<<"Enter text: "; cin.getline(sen, 200); convert(sen); cout<<"Try again?[Y/N] "; cin>>r; cin.ignore(); }while(r=='y' || …