Answer Posted / vivek

take a stack and push operators into stack such as (*,+,_,/,etc) and when 2 operands(let a & B) appears pop out 1 operator and perform the expression (a operator B) and push it in 2 a stack



eg: ++2 6+-13 2 4
+(2+6) +-13 2 4
+8+(13-2)4
+8+11 4
+8(11+4)
+8 15
8+15
23 ans

How much time does it take to learn data structures?

862

---

How do you find the depth of a binary tree?

925

---

What is sorting and classifying?

840

---

List the data structures which are used in network data modal.

826

---

Define linear probing?

928

---

What is data structure geeksforgeeks?

1197

---

Complete structure of hashmap, very detail description, along with the basic coding of the hashmap internal implementation.

1048

---

Which is faster quick sort or merge sort?

777

---

What is sequential search? What is the average number of comparisons in a sequential search?

770

---

What does list clear do?

812

---

How many links are there in a binary tree of N nodes?

966

---

In rdbms, explain what is the efficient data structure used in the internal storage representation?

888

---

What is a minimum spanning tree?

1006

---

How does a treemap sort?

781

---

How do you find the space complexity of a bubble sort?

792

---