which types of data structure will i use to convert infix to
post fix???
Answers were Sorted based on User's Feedback
Answer / abhishek munde
To convert the infix to postfix, STACK datastructure is
used. some may think about tree but by we only denote the
expression actual conversion is done through STACK.
| Is This Answer Correct ? | 12 Yes | 2 No |
Answer / prashant
stack is really used to convert infix to postfix
| Is This Answer Correct ? | 5 Yes | 0 No |
Answer / khaja
stack only bcoz in memory the operations are done in stacks only
| Is This Answer Correct ? | 2 Yes | 1 No |
find largest element in array w/o using sorting techniques.
What is the use of putchar function?
What is far pointer in c?
What is a lvalue
What are identifiers c?
Is null equal to 0 in sql?
Which operators cannot be overloaded a) Sizeof b) .* c) :: d) all of the above
What is c token?
What's a "sequence point"?
Are pointers really faster than arrays?
write a program that declares an array of 30 elements named "income" in the main functions. then cal and pass the array to a programmer-defined function named "getIncome" within the "getIncome" function, ask the user for annual income of 30 employees. then calculate and print total income on the screen using the following function: "void getIncome ( ai []);
What does extern mean in a function declaration?