3.4 Infix Prefix and Postfix expressions | Data structures
In this lecture, I have described infix prefix and postfix notations which are ways to write arithmetic and logical expressions. I have also discussed how to evaluate infix prefix and postfix expressions with examples.
Comments
Related Posts
Prim's Algorithm - Graphs | Minimum Spanning Tree(MST) in Graphs | Code and Implementation
Creating a Single Linked List (Part 2)
Lec-71: Transaction States | Database Management System
Tree Traversal: In-Order Traversal
7.11 Shell Sort algorithm | sorting algorithms | Full explanation with code | data structures
