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
- 21715 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What is the difference between a Stack and a Queue.
Give a real time example of stack
What are the drawbacks of array implementation of queue?
How to sort 1 million floating point numbers?
Can you sort a string?
What is internal and external sorting?
Why is treeset sorted?
Write an algorithm to check if there is a loop in a doubly linked list.
What is the difference between Array and LinkedList?
What should be done in the base case for this recursive problem?
What does sorting an array do?
Write a code for dynamic allocation of array.
Which sorting is worst?
What is bubble sort used for?
Can we insert null in list?
