3.9 Evaluation of Prefix and Postfix expressions using stack | Data structures

Jenny's lectures CS/IT NET&JRF
Youtube
Related Topic
:- Data Structures

In this lecture I have described how we can evaluate prefix and postfix expressions efficiently using stack data structure. 

ORIGINAL Video

Comments

Related Posts

your image

Side view of binary tree Algorithm(Left and right side view)

Youtube
your image

Queue Data Structure in Hindi

Youtube
your image

Selection Sort | GeeksforGeeks

Youtube
your image

DBMS Components(Actors), Types of Users in Database

Youtube
your image

7.12 Counting Sort algorithm (analysis and code)- Easiest explanation | data structure

Youtube