Infix, Prefix and Postfix @mycodeschool
Infix, Prefix and Postfix  @mycodeschool
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
Infix, Prefix and PostfixGraph Representation part 03 - Adjacency ListData Structures: Arrays vs Linked ListsInstalling and configuring gcc / g++ on Windows.Modular exponentiation - using RecursionTime and space complexity analysis of recursive programs - using factorialMaximum sum sub-arrayData structures: Array implementation of QueueCount occurrences of a number in a sorted array with duplicates using Binary SearchData structures: Binary Search TreeIntroduction to sorting algorithmsTime Complexity analysis of recursion - Fibonacci Sequence
mycodeschool |

Infix, Prefix and Postfix

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER