Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))
Answer Posted / amit patra
=a-b+c*(d/e-(+fg)
=a-b+c*(/de-(+fg)
=a-b+c*(-/de+fg)
=a-b+c*-de+fg
=-ab+c*-de+fg
=*-+abcde+fg
| Is This Answer Correct ? | 1 Yes | 13 No |
Post New Answer View All Answers
What happens when arraylist is full?
What is minimum depth of binary tree?
Explain different methods in which you can traverse a tree?
Does treemap sort on key or value?
What is a Stack? Explain with example?
Can we add elements to final list?
Define adjacent nodes?
What do you mean by 2-3-4 tree?
What is the procedure to insert into a sorted array?
What is the time complexity of hashmap get () and put () method?
What is the space complexity of bubble sort?
What will be the output of below code?
What is an acyclic graph?
What is space complexity of a program?
Which is better merge or quick sort?