Postfix to Infix Conversion in C++

[kanan010506]

This PR adds a stack-based C++ program to convert postfix expressions into infix notation.

✅ Features:

• Handles operators: + - * / ^
• Supports single-character operands (letters and digits)
• Properly uses parentheses to preserve operator precedence
• Fully compilation-safe and tested

💡 Why it’s useful:

• Helps beginners understand stacks, expression evaluation, and conversion algorithms
• Useful in calculators, compilers, and expression parsing
• Easy to read, maintain, and extend

🧪 Example:

Input:  AB-DE+F*/
Output: ((A-(B/D))*E+F)

---

[github-actions]

🎉 Welcome to Hacktoberfest 2025, @kanan010506! 🎃

Thank you for your first contribution to our DSA repository! Here's what happens next:

🔍 Automatic Checks

• ✅ Code Validation: Passed
• 🧪 Compilation Tests: Passed

📋 Next Steps

🎯 Great job! Your code compiled successfully. Maintainers @admirerr and @kartikey2991 will review your PR soon.

🎁 What You Get

• 🏆 Hacktoberfest Credit: This PR counts toward your 6 PR goal for exclusive T-shirt + Tree!
• 🌟 Hall of Fame: You'll be featured in our contributors list
• 📚 Learning: Code review feedback from experienced developers

💡 Tips for Success

• Follow our Contributing Guidelines
• Add comments explaining your algorithm
• Include time/space complexity analysis
• Test your code before submitting

Welcome to the community! 🚀

[github-actions]

🤖 Automated PR Status

🔍 Code Validation

✅ Passed - File naming and structure look good!

🧪 Compilation Tests

✅ Passed - All code compiles successfully!

📋 Overall Status

🎉 Ready for Review - Your PR has passed all automated checks!
👥 Maintainers have been notified for review.

---

This comment was generated automatically. Checks will re-run when you push new commits.

[admirerr]

Approved