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

What is an Algorithm ? | Data Structures and Algorithms

Youtube
your image

Data Structures: Trees

Youtube
your image

L-4.7: What is Spanning Tree with Examples in Hindi | Algorithm

Youtube
your image

How to Remove Node in BST - Solution | Binary Search Tree | Data Structure and Algorithms in JAVA

Youtube
your image

Application of Trees

Youtube