Convert the following infix expression to post fix notation
((a+2)*(b+4)) -1
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 ? | 57 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 better hashmap or hashtable?
What are linked lists used for?
Explain the common uses of threaded binary tree.
What is 2 dimensional linked list?
Mention the data structures which are used in graph implementation.
Define linear data structures?
How many types of data structures are used?
What do you mean by hash function?
Explain different methods in which you can traverse a tree?
Describe stack operation.
Give a real time example of stack
What are the properties of binary heap?