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
- 21757 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 |
Write an algorithm to show the postfix expression with the input given as : a b + c d +*f ? .
What is difference between hashset and linkedhashset?
Write an algorithm to find middle element in the linked list.
How does variable declaration affect memory allocation?
What is difference between linear and non linear data structure?
How do you find the size of an arraylist?
Write a program to insert an element and in the specific position in the array?
When will you sort an array of pointers to list elements, rather than sorting the elements themselves?
What are the different types of sorting in data structure?
What is variable size arrays?and why we use it?
How to traverse data in a linked list in forward and backward direction, write the algorithm?
Give a basic algorithm for searching a binary search tree?
Windows 
