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 how we can evaluate Prefix and Postfix expressions efficiently using stack data structure.

See source code here:
gist.github.com/mycodeschool/7702441

For practice problems and more, visit: mycodeschool.com

Like us on Facebook: facebook.com/MyCodeSchool

Follow us on twitter: twitter.com/mycodeschool