Скачать или смотреть 26: Expression Tree | Preorder | Inorder | Postorder | Tree Traversal

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 that how to create an expression tree. I have taken som mathematical expression to create an expression tree with example.


At the end you will get clear concept of create expression tree in stack.


Topic covered:
1. Creation of expression tree
2. Tree traversal
3. Infix to Prefix using Expression tree
4. Infix to Postfix using Expression tree

Preorder Traversal gives Prefix Notation
Inorder Traversal gives Infix Notation
Postorder Traversal gives Postfix Notation


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 Linked List  

Insert node at specific position:
   • 15: Insertion of a Node at Specified Posit...  

Doubly linked list creation:
   • #13: Creation of Linked List with Full Cod...  

#ezycode
#datastructures
#stack
#dsa
#clanguage