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

Shortest/Longest path on a Directed Acyclic Graph (DAG) | Graph Theory

Youtube
your image

Replace Sum of Larger in BST - Question | Binary Search Tree| Data Structure and Algorithms in JAVA

Youtube
your image

Dijkstra's Algorithm: Another example

Youtube
your image

Double-Ended Queue in Data Structure (DE-Queue Explained)

Youtube
your image

B-Tree example

Youtube