Uploaded November 2013 | Updated September 2026, 2 weeks ago
See complete series on data structures here:
youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
In this lesson, we have described Infix , Prefix and Postfix notations which are ways of writing arithmetic and logical expressions. Infix notation is the most common way of writing expressions. Prefix and Postfix notations are other two ways that are good for machines because they can be parsed and evaluated easily. This is one important topic in computer science where we find application of stack data structure.
For practice problems and more, visit: mycodeschool.com
Like us on Facebook: facebook.com/MyCodeSchool
Follow us on twitter: twitter.com/mycodeschool
See complete series on data structures here:
youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
In this lesson, we have described Infix , Prefix and Postfix notations which are ways of writing arithmetic and logical expressions. Infix notation is the most common way of writing expressions. Prefix and Postfix notations are other two ways that are good for machines because they can be parsed and evaluated easily. This is one important topic in computer science where we find application of stack data structure.
For practice problems and more, visit: mycodeschool.com
Like us on Facebook: facebook.com/MyCodeSchool
Follow us on twitter: twitter.com/mycodeschool










