Convert the following infix expression to post fix notation
((a+2)*(b+4)) -1
Answer Posted / ahan
( ( a + 2 ) * ( b + 4 ) ) - 1
\ / /
a2+ b4+ /
\ / /
/
a2+b4+* /
\ /
a2+b4+*1-
| Is This Answer Correct ? | 58 Yes | 2 No |
Post New Answer View All Answers
What is complete binary tree and almost complete binary tree?
How do you sort in ascending order in arraylist?
What do you mean by primary clustering?
How many pointers are necessary to implement a simple linked list?
Why is tuple immutable?
Why is it important to sort waste?
Is list an array?
Why do we need searching algorithms?
what is a balanced tree.
Write an algorithm to show the reverse of link list?
Define ancestor and descendant ?
What is push and pop in stack?
Which sorting algorithm is used in collections sort?
Differentiate between priorityqueue and treeset.
Define distributed query and linked server?