0 votes 0 votes someone please post infix to prefix and infix to post fix ( with using stack and without using stack ) accurate and authentic algorithm also please tell the procedure to convert prefix to postfix and vice versa in simple terms Meenakshi Sharma asked Nov 13, 2016 Meenakshi Sharma 1.7k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Prashant. commented Nov 13, 2016 reply Follow Share google it. copy from some website by others isnt help you. 0 votes 0 votes Meenakshi Sharma commented Nov 16, 2016 reply Follow Share is this algo correct copied from google Conversion from Prefix to Postfix The algorithm for converting a Prefix expression to a Postfix notation is as follows: Accept a prefix string from the user. Start scanning the string from right one character at a time. If it is an operand, push it in stack. If it is an operator, pop opnd1, opnd2 and concatenate them in the order (opnd1, opnd2, optr) as follows: strcpy(arr,opnd1); strcat(arr,opnd2); stracat(arr,optr); Push the result in the stack. Repeat these steps until arr of input prefix string ends. Pop the remaining element of the stack, which is the required Postfix notation equivalent to a given Prefix notation. 0 votes 0 votes Please log in or register to add a comment.