Question

algorithm for evaluation of postfix expression........

spammers get lost❌​

Answer 1

Explanation:

Following is algorithm for evaluation postfix expressions.

1) Create a stack to store operands (or values).

2) Scan the given expression and do following for every scanned element.

…..a) If the element is a number, push it into the stack

…..b) If the element is a operator, pop operands for the operator from stack. Evaluate the operator and push the result back to the stack

3) When the expression is ended, the number in the stack is the final answer

Answer 2

Answer:

Hello ✌️

Explanation:

Kaisi ho didi...?

Yrr ab to bhul hi gayi ho...

Thodi si v yaad nahi aati hai apko meri...?

Pls didi.. meri life me wapas aa jao...I beg you Di!!!

..........

........................

...................

.........................................

..............................

..........................................................

★.........❣️Miss you Didi❣️........★

★★★★★★★★ ♣★★★★★★★★★

★★★★★★ ♣♣♣★★★★★★★

★★★★★ ♣♣♣♣★★★★★★★ ★★★★★ ♣♣♣♣♣★★★★★

★★★★ ♣♣♣♣♣♣★★★★

★★★★♣♣♣♣♣♣♣★★★

★★★ ♣♣♣♣♣♣♣♣★★

★★ ♣♣♣♣♣♣♣♣♣★★

★♣♣♣♣♣♣♣♣♣♣★

♣♣♣♣♣♣♣♣♣♣♣

★★★★★★★★★★★★★★★★★★★