Infix to postfix/prefix convertor and evaluator.
-
Updated
Oct 4, 2020 - JavaScript
Infix to postfix/prefix convertor and evaluator.
Given an expression of binary operators as input in the character array, you are required to design a solution in C++ for converting that expression in prefix, postfix and then evaluating that expression. Also you will check its validity (correct use of brackets and operators). The intend is for the given input expression in character array 1. C…
A simple Postfix Prefix Calculator based on stack.
Add a description, image, and links to the postfix-conversion topic page so that developers can more easily learn about it.
To associate your repository with the postfix-conversion topic, visit your repo's landing page and select "manage topics."