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
- 21982 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 order of b tree?
Write the recursive c function to count the number of nodes present in a binary tree.
Which sorting algorithms are in place?
How would you check if a binary tree is BST or not ? Write a program.
What is non linear structure?
Define internal nodes?
Which is better selection or bubble sort?
What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks
How to reverse a singly linked list?
What is the non linear data structure?
Define structure property in a heap?
How do you clear a stack?
State the difference between persistent and ephemeral data structure?
How do you find the height of a binary tree?
What is stack explain with diagram?
