Easiest tricks to solve tickiest expressions of stack

摘要

This paper mainly focuses on the best and efficient methods that could simplify the stack expression solving techniques in the easiest possible and enjoyable manner. It gives a detailed description of, using shortest tricks and techniques (methodology) to solve infix expression of stack into a postfix expression. Basically, the proposed work have been made, to provide an emphasis on, how to solve stack expression, without learning the precedence of operators rather by just memorizing two very simple words that the authors have proposed in the methodology section. All in all, authors have focused on, how smart work along with hard work is beneficial in today's competitive world as compared to boring bookish methods to provide a platform in solving the expressions of stack involving logical and relational operators respectively by using various working examples. The proposed concept have been shown by the help of various self-proposed algorithms that have been validated by simulation on a proposed machine learning model to facilitate the same process.