[OTHER]Infix to Postfix Converter using Stack(java)

[laiba-Ashfaq]

What would you like to share?

This C++ program converts an infix expression (like A+B*C) into a postfix expression (A B C * +) using the STL stack. It follows operator precedence and associativity rules to ensure correct order of operations. The stack is used to temporarily store operators and parentheses during conversion.

Example: Input: A+B*C Output: A B C * +

Time Complexity: O(n) Space Complexity: O(n)

Additional information

No response

[laiba-Ashfaq]

assign this to me under hacktoberfest 2025 label

[PRITISH-TOMAR]

\assign

[laiba-Ashfaq]

@PRITISH-TOMAR assign under hactoberfest 2025 label

[laiba-Ashfaq]

@PRITISH-TOMAR merge my pull request under hacktoberfest 2025 label plz

[Prasoon31Pandey]

/ assign pls sir assign it to me

[github-actions[bot]]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!