a-b+c*(/de-(+fg)) a-b+c*(-/de+fg) a-b+*c-/de+fg -ab+*c-/de+fg +-ab*c-/d

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

Question Posted / bipin fro uu mca

Answer Posted / bipin fro uu mca

a-b+c*(/de-(+fg))
a-b+c*(-/de+fg)
a-b+*c-/de+fg
-ab+*c-/de+fg
+-ab*c-/de+fg

Is This Answer Correct ?

8 Yes

2 No

Please Help Members By Posting Answers For Below Questions

Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?

976

What are the topics in data structures?

1075

Mention for which header list, you will found the last node contains the null pointer?

902

How do treesets work internally?

1000

How do you rotate an AVL tree?

1024

What type of memory allocation is referred for Linked lists?

1240

How to find 3rd element from end in a linked list in one pass?

936

Is binary tree a bst?

960

Model a data structure for a DFA that takes an event as parameter and performs a desired action.

1152

What does the dummy header in the linked list contain?

1209

Differentiate between an array and an arraylist.

1131

Does treemap allow null keys?

987

Explain about the different lists available in the collection?

922

Is null a binary search tree?

893

What is the use of data structure?

980