This repository contains C++ implementations of Prefix, Postfix, and Infix expression conversion algorithms. These algorithms are fundamental for understanding how expressions are parsed and evaluated in computer science.
- Prefix to Infix Conversion
- Postfix to Infix Conversion
- Evaluation of Postfix Expressions
Clone this repository to your local machine:
git clone https://github.com/RezaGooner/prefix-postfix-algorithms.gitThen compile and run the C++ code using your preferred IDE or command line:
g++ main.cpp -o expression-converter
./expression-converter- Prefix to Infix: Convert a prefix expression (e.g.,
+ A B) to its infix form(A + B). - Postfix to Infix: Convert a postfix expression (e.g.,
A B +) to its infix form(A + B).
This project is licensed under the Apache-2.0 License.
Feel free to adjust the content to match any specific details or functionality you would like to highlight!