a-b+c*(/de-(+fg)) a-b+c*(t-s) if t=/de;s=+fg a-b+c*(-ts) -ab+*c-ts +-ab

Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))

Question Posted / p.divya poojitha

Answer Posted / p.divya poojitha

a-b+c*(/de-(+fg))
a-b+c*(t-s) if t=/de;s=+fg
a-b+c*(-ts)
-ab+*c-ts
+-ab*c-ts
sol is +-ab*c-/de+fg

Is This Answer Correct ?

0 Yes

1 No

Please Help Members By Posting Answers For Below Questions

What is heap tree?

908

What is binary tree in computer science?

875

What is the easiest sorting method to use in data structures?

1037

Can arraylist contain null?

817

What do you mean by data and data structure?

939

What is array and structure?

941

You want to insert a new item in a binary search tree. How would you do it?

878

Why do we study data structures?

889

Can we remove element from arraylist while iterating?

931

Why do we need a data structure?

964

What sorting algorithm does arrays sort use?

794

Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?

921

What is mean by sorting?

862

Differentiate between push and pop?

1212

What is a dequeue?

934