240,153 views 773 on YTPak
1,196 34

Published on 09 Dec 2013 | over 3 years ago

See complete series on data structures here:
www.youtube.com/playlist

In this lesson, we will see an efficient algorithm to convert Infix to Postfix using stack data structure.

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

For practice problems and more, visit: www.mycodeschool.com

Like us on Facebook: www.facebook.com/MyCodeSchool

Follow us on twitter: twitter.com/mycodeschool´╗┐

Loading related videos...
(function(){ var spoutjs=document.createElement('script'),firstjs=document.getElementsByTagName('script')[0]; spoutjs.async=1; spoutjs.src='//cdn.spoutable.com/0f93c30c-199b-4e71-90dc-dbb5de72cee5/spoutable.js'; firstjs.parentNode.insertBefore(spoutjs,firstjs) })(); */ ?>