Скачать или смотреть 30: How to Create Expression Tree Using Prefix Expression | Stack

CSE/IT/MCA and BCA Free Placement Series
we will learn ho to create expression tree using prefix expression with example ‪@EzyCode‬ .

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. How to create expression tree using prefix expression
2. Preorder traversal
3. Cross check of expression tree by tree traversal

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  

#ezycode
#stack
#datastructures
#clanguage
#dsa