Using my own stack and queue implementations, this program takes several lines of infix notation mathematical calculations, convert them to postfix notation, and evaluate them.
-
Updated
Jan 16, 2021 - Java
Using my own stack and queue implementations, this program takes several lines of infix notation mathematical calculations, convert them to postfix notation, and evaluate them.
This is a simple infix to postfix converter written in JavaScript. It is a simple project that I made to show other students how they can easily design this type of program and how they can use it to solve their problems.
Add a description, image, and links to the infix-expressions topic page so that developers can more easily learn about it.
To associate your repository with the infix-expressions topic, visit your repo's landing page and select "manage topics."