24: Infix to Postfix Conversion | Expression Notation | Stack
CSE/IT/MCA and BCA Free Placement Series
We can represent the expression in three different way namely Infix, prefix and postfix notation.
stack plays an important role for mathematical expression evaluation. In this video, I have covered basics of these three representation style.
these are as follows:
1. Infix Notation
2. Prefix Notation
3. Postfix Notation
also, i have discussed about conversion of infix notation to prefix notation with example.
Topic covered:
1. Infix representation
2. Prefix representation
3. Postfix representation
The basic operations and terminology used in stack is
1. PUSH : Insertion of an item in the stack is called PUSH
2. POP : Deletion of an item from the stack is called POP
3. Overflow: if the stack is full, even we will try to insert an item in the
stack then overflow occurs.
4. Underflow: If the stack is empty even we will try to remove an item from stack then underflow occurs.
5. LIFO : (Last In First Out) The item which is inserted at last will be removed at first.
6. Stack has only one open end.
7. Insertion and deletion of item takes place from one end.
Facebook Ezycode:
-------------
/ ursmartcoder
Facebook Chandra Mani:
-------------
/ cmofindia
Links:
-------------
Delete node from first node:
• #7: Deleting First Node | Singly Link...
Insert node at specific position:
• 15: Insertion of a Node at Specified ...
Doubly linked list creation:
• #13: Creation of Linked List with Ful...
#ezycode
#datastructures
#stack
#dsa
#clanguage
En esta página del sitio puede ver el video en línea 24: Infix to Postfix Conversion | Expression Notation | Stack de Duración hora minuto segunda en buena calidad , que subió el usuario ezycode 01 diciembre 2022, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 239 veces y le gustó 8 a los espectadores. Disfruta viendo!
