13-11-15, 02:04 PM
write a complete c++ program that uses stack ADT in infix to post fix expressioin conversion, your program should ask the user to input an infix expression and then prints the corresponding postfix expression
example if input was: A+(B*C-(D/E-F)*G)*H
the the output will be
ABC*DE/F-G*-H*+
ممكن حدا يساعدني بكتابة الكود ضروري
example if input was: A+(B*C-(D/E-F)*G)*H
the the output will be
ABC*DE/F-G*-H*+
ممكن حدا يساعدني بكتابة الكود ضروري