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
Arrays and Abstract Data Type in Data Structure (With Notes)
1. Introduction to Algorithms
Reverse a Linked List Code/Algorithm/Program
Linear Searching Algorithm in Data Structures | C++ Program to Implement Linear Search Algorithm
Find 'n' th node from end of Linked List (CODE) [updated]
