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
2.10 Implementation of Doubly Linked List - Data Structures
DSUC14: Applications of Array in data structure| Sparse matrix and its representation
INORDER SUCCESSOR in binary search tree[CODE Explained]
What Is a Binary Heap?
Deletion in a Linked List | Deleting a node from Linked List Data Structure
