Answer Posted / navneet kang

++26 + -1324
METHOD:-
Start scanning the string from the right one character at a time.
If it is an operand, push it in stack.
If it is an operator, pop opnd1, opnd2 and perform the operation, specified by the operator. Push the result in the stack.
Repeat these steps until arr of input prefix strings ends.
Solution
1)Push 4,2,13 in stack one by one
2) - operator encountered
3)Take out 13 and 2 from stack and perform operation
4)Now Stack consist of 4,11
5)+ operator encountered
6)Now Stack consist of 15
7)Now push 6 in stack,Hence Now Stack consist of 15,6,2
8)Perform add operation + encountered
9)Now Stack consist of 15,8
10)+ operator encountered
11)Now Stack consist of 23

Hence Answer is 23

Is python good for freshers?

1027

---

What are the different types of data structures explain briefly?

1149

---

How many passes does bubble sort need?

983

---

How to find 3rd element from end in a linked list in one pass?

934

---

What is the logic to reverse the array?

954

---

Which is better merge sort or quick sort?

905

---

How to reverse singly link list?

996

---

Tell us the difference between merge and quick sort. Which one would you prefer and why?

1077

---

What is dequeue operation?

1022

---

What is a B tree?

1055

---

What are the types of data structures?

1204

---

List the differences between comparable and comparator interface?

972

---

What are the properties of binary tree?

955

---

What is a spanning tree in data structure?

1019

---

What sort does arrays sort use?

910

---