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
Radix Sort | Time and Space | Data Structure and Algorithms in JAVA
Priority Queue in Data Structure | Priority Queue Using Linked List | DSA 00 | Data Structures
Infix to Prefix conversion | Examples | Data Structures | Lec-16 | Bhanu Priya
Bubble Sort | GeeksforGeeks
Operations on Data Structure with example
