4 votes 4 votes The infix expression $A+(B-C)^*D$ is correctly represented in prefix notation as $A+B-C^*D$ $+A^*-BCD$ $ABC-D^*+$ $A+BC-D^*$ DS isro2009 data-structures stack infix-prefix + – go_editor asked Jun 14, 2016 • edited Jan 24 by makhdoom ghaya go_editor 3.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 6 votes 6 votes Option B Scan Right to Left Stack : * ) - Pop - ) by seeing ( Stack: * Pop * as incoming is + Stack : + Output : +A*-BCD shivanisrivarshini answered Jun 14, 2016 • selected Jun 14, 2016 by LeenSharma shivanisrivarshini comment Share Follow See all 0 reply Please log in or register to add a comment.
5 votes 5 votes ( ) has highest priority then * then +. so whatever inside the bracket will be evaluated first A+(−BC) *D A+((−BC) *D)) A+(*−BCD) (A+(*−BCD)) +A*−BCD OPTION B asu answered Jun 14, 2016 asu comment Share Follow See all 0 reply Please log in or register to add a comment.