Algorithms
Algorithms copied to clipboard
Prefix-Postfix-Inflix interconversion algorithm in C & Java
Given string S representing a postfix expression, the task is to evaluate the expression and find the final value. Operators will only include the basic arithmetic operators like *, /, + and -.
Instead you could work on Prefix-Postfix-Inflix interconversion algorithm which is yet to be implemented in C
& Java
(refer algo. no. 66)
refer:
- https://github.com/Kumar-laxmi/Algorithms/blob/main/C%2B%2B/Maths/Infix_Postfix_Prefix_Interconversion.cpp
- https://github.com/Kumar-laxmi/Algorithms/blob/main/Python/Maths/prefix_infix_postfix_interconversion.py
Assigned! @AnubhaSharma2709 : C & Java
@Kumar-laxmi plz assign this to me as my first issue.
I would like to work on this issue, kindly assign this to me.
This issue has been automatically closed because it has been inactive for many days. Please reopen if you still intend on working on this problem