Interested to Buy Any Domain ? << Click Here >> for more details...
Convert the following infix expression to post fix notation
((a+2)*(b+4)) -1
- 9 Answers
- 21350 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 |
Explain what are the methods available in storing sequential files ?
What is a pass in bubble sort?
What are the disadvantages of representing a stack or queue by a linked list?
What are the advantages of linked list over array (static data structure)?
What is the similarity between a Structure, Union and enumeration?
What is a treemap chart?
How do you find the number of comparisons in bubble sort?
How much time does it take to learn data structures?
How do you create a tree diagram?
Does set allow null values?
How to sequentially represent max-heap?
What will you prefer for traversing through a list of elements between singly and doubly linked lists?
Windows 
