Перейти к содержимому

3.7 Infix to Postfix conversion using Stack | Data structures and algorithms

Jenny's Lectures CS IT

0:00 / 0:00

3.7 Infix to Postfix conversion using Stack | Data structures and algorithms

620 115 просмотров · 7 лет назад
Jenny's Lectures CS IT
2,11 млн подписчиков
620 115 просмотров · 7 лет назад
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 with the help of examples. 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. ****************************************** More Playlists: DSAwith C Full Course: https:    • Data Structures and Algorithms   C Programming Course:    • Programming in C   C++ Programming:    • C++ Placement Course   Python Full Course:    • Python Full Course   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 #ugcnet #ugcnetexam #datastructures #jennyslectures