In prefix expression evaluation we have to scan the string from right to left. If we encounter any operand then we will push it into the stack and if we encounter any operator then we will pop two elements from the stack and perform the operation using current operator and the result will get pushed in stack.