3.9 Evaluation of Prefix and Postfix expressions using stack | Data structures
In this lecture I have described how we can evaluate prefix and postfix expressions efficiently using stack data structure.
Comments
Related Posts
Data Structures And Algorithms in Python - Python Data Structures Full Tutorial (2020)
Binary Search Tree - Successor Predecessor
Equilibrium Element in Array in o(n) time complexity ( Interview Question for FAANG companies)
DSUC4 Time Space trade off with Example in Data Structure | Space Time Trade Off
Delete a node from Doubly Linked List(start / middle/ end node)
