Answer / Kumar Saurav

A 2-3 tree (or B-tree) is a self-balancing search tree that can efficiently store large amounts of data. It's called a 2-3 tree because each internal node has either two or three child nodes.

Stack can be described as a pointer. Explain.

5 Answers   Wipro,

---

How would you implement two stacks using a single array?

1 Answers   TCS,

---

Does treemap sort automatically?

1 Answers  

---

What is the use of prototype?

1 Answers  

---

Define right-in threaded tree?

1 Answers  

---

What is priority queue in data structure?

1 Answers  

---

What is the difference between arraylist and array?

1 Answers  

---

What is meant by binary tree traversal?

1 Answers  

---

Write the algorithm for converting infix expression to postfix expression?

1 Answers  

---

Define balanced trees?

1 Answers  

---

What is data structure and why we need it?

1 Answers  

---

What is complexity of quicksort?

1 Answers  

---