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
- 21743 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 |
If you have to store one lakh objects, what will be a better option- a hash map or an array list?
Differentiate file structure from storage structure?
How is any data structure application is classified among files?
What do you mean by garbage collection?
Why are b trees used?
What is default size of hashmap?
How does quick sort work?
Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?
What are the four characteristics of algorithms?
How do you find the space complexity of a bubble sort?
Define open addressing?
If I try to add enum constants to a treeset, what sorting order will it use?
Windows 
