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
- 21599 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
Is copyonwritearraylist thread safe?
Does concurrenthashmap allow null?
How is the front of the queue calculated in data structure?
What is data structure and its classification?
How to copy an array into another array?
We know that Arrays are objects so why cannot we write strArray.length()?
What is dynamic data structure?
Write a program for reversing the Single Linked List?
Why using cookie to store session info is a better idea than just using session info in the request?
Which is better hashmap or treemap?
Mention the advantages of representing stacks using linked lists than arrays?
Mention a few applications of linked lists?
how to display Singly Linked List from First to Last?
What is return map?
Differentiate between singly and doubly linked lists?
