Convert the following infix expression to post fix notation
((a+2)*(b+4)) -1
- 9 Answers
- 19937 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / ahan
( ( a + 2 ) * ( b + 4 ) ) - 1
\ / /
a2+ b4+ /
\ / /
/
a2+b4+* /
\ /
a2+b4+*1-
| Is This Answer Correct ? | 58 Yes | 2 No |
Answer / arun chowdary g
a2+b4+*1- is correct because in postfix traversals are from
left, right and then root.
| Is This Answer Correct ? | 37 Yes | 4 No |
Answer / pavan
@ Revathy :
Postfix : AB+DC-*
Prefix : *+AB-DC
Best way to find Prefix adn post fix is to create a Binary
tree and do a pre-order traversal and post order traversal
on it.
| Is This Answer Correct ? | 7 Yes | 1 No |
Answer / revathy
Convert the following expression to postfix and prefix
(A+B) * (D-C)
| Is This Answer Correct ? | 5 Yes | 5 No |
Which is the parent class of sortedset<e> class?
How do you sort an array in descending order?
Can we store primitives in collections?
What are the types of binary tree?
Is hashtable better than dictionary?
What is arraylist load factor?
Can we declare array size as a negative number?
How will you represent a linked list in a graphical view?
What is vector and types of vector?
What is a height of a tree?
Write a program to reverse a link list.
Explain the expression trees?
Windows 
