freelanceprogrammers.org Forum Index » C
Implementation of the binary tree to covert an infix express
Joined: 03 Jan 2005
Posts: 1
Implementation of the binary tree to covert an infix express
The program should display the following command base menu when the it runs:
press `i` to enter an infix expression.
press `p` to show the prefix expression of the given infix expression.
press `t` to show the postfix expression of the given infix expression.
press `e` to evaluate the value of the postfix expression.
press `x` to exit the program.
// I MUST USE THESE PROTOTYPED FUNCTIONS TO ORGANIZE YOUR CODE.
// check the validity of the expression by checking each character in this string from 0-9 and operators ( +, -, *, / )
returns 1 if expression is valid.
int isValid (const string &exp ) {
// write your code here.
}
// evaluates the given postfix expression and returns the result.
int evaluatePostfix ( const string &exp) {
// write your code here.
}
// converts the infix expression to postfix and returns it.
string toPostfix ( const string &exp ) {
// write your code here.
}
// converts the infix expression to prefix and returns it.
string toPretfix ( const string &exp ) {
// write your code here.
} Yahoo! Messenger - Communicate instantly..."Ping" your friends today! Download Messenger Now
All times are GMT
Page 1 of 1
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
Freelace Website Designer - Customer web design and software building.
China Wholesale - Electronics Products
Character Studio - Tutorials and Help
China Wholesale - Electronics Products
Character Studio - Tutorials and Help