3.5 Infix to Postfix Conversion Rules using Stack | Data structures Tutorials

Опубликовано: 19 Январь 2019
на канале: Jenny's Lectures CS IT
673,175
9.6k

Jennys Lectures DSA with Java Course Enrollment link: https://www.jennyslectures.com/course...

In this video, I have explained the conversion of INFIX expression to POSTFIX expression using STACK. Keeping in mind the priority of operators(precedence) as well as associativity of operators. Associativity comes into picture when two operators of the same precedence arrive like addition and subtraction, multiplication and division etc.

DSA Full Course: https:    • Data Structures and Algorithms  
******************************************

More Playlists:
C Programming Course:    • Programming in C  

C++ Programming:    • C++ Complete Course  

Python Full Course:    • Python - Basic to Advance  

Printing Pattern in C:    • Printing Pattern Programs in C  

DAA Course:    • Design and Analysis of Algorithms(DAA)  

Placement Series:    • Placements Series  

Dynamic Programming:    • Dynamic Programming  

Operating Systems: //   • Operating Systems  

DBMS:    • DBMS (Database Management System)  
********************************************

Connect & Contact Me:

Facebook:   / jennys-lectures-csit-netjrf-316814368950701  
Quora: https://www.quora.com/profile/Jayanti...
Instagram:   / jayantikhatrilamba  

#infixtopostfix #jennyslectures #datastructures