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
- 21996 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 |
What is max heapify?
What is a b+ tree? Explain its uses.
Define dynamic data structures?
What type of algorithm is binary search?
Will arraylist maintain insertion order?
How many types of lists are there?
How to copy an array into another array?
what is mean by d-queue?
What is dynamic array how it is created?
what is a balanced tree.
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What is circular linked list?
Windows 
