Evaluate the following prefix expression " ++ 26 + - 1324"
Answer Posted / narayan kunal
for evaluating the prefix expression first reverse the
prefix expression then sole like postfix expression
the reverse of given expression is
4231-+62++
then push 4,2,3,1 to stack ,now pop last two elements and
1-3=-2
now again push -2 to stack,now the element of stack is 4,2
,-2 again pop last two elements and do
-2+2=0
we know that if zero comes like symbol then we directly pop
this and proceed to next step
now the content of stack is 4 lets go to the next step
push 6 and 2 to the stack so now content of stack is 4,6,2
now
pop last two elements
6+2=8
push 8 to stack
content of stack is 4,8
again remove last two elements of elements and do
4+8=12
now all operator and operand ends up
so final answer is 12
Is This Answer Correct ? | 2 Yes | 2 No |
Post New Answer View All Answers
Define ancestor and descendant ?
How would you check if a binary tree is BST or not ? Write a program.
What is height balanced tree?
How is the front of the queue calculated in data structure?
What are the Differences between map and hashmap?
What are the scenarios in which an element can be inserted into the circular queue?
Is json a data structure?
What is an example of an array?
What does sorting an array do?
Explain binary searching and Fibinocci search?
Can you please explain the difference between string and an array?
Which list does not allow duplicates?
Will arraylist maintain insertion order?
Why do we use sorting?
How is heap sort implemented?