Array-based implementation of Calculator of very large integers with the length of the numbers as large as 2,147,483,647 (2^31 - 1), with Postfix and Infix evaluation of Arithmetic Expressions.
-
Updated
Jun 25, 2021 - Java
Array-based implementation of Calculator of very large integers with the length of the numbers as large as 2,147,483,647 (2^31 - 1), with Postfix and Infix evaluation of Arithmetic Expressions.
Application using implemented stack data structure to convert from infix to postfix notations. And evaluate the postfix expression
Add a description, image, and links to the infixtopostfix-expression topic page so that developers can more easily learn about it.
To associate your repository with the infixtopostfix-expression topic, visit your repo's landing page and select "manage topics."