Answer / Deepika Rajwani

A binary tree is a recursive data structure in which each node has at most two children, called the left child and the right child. Here is an example of a simple binary tree:nn```n1n| n-- 2n| n--- 3n| n-- 4n```

Which sorting method is slowest?

1 Answers  

---

What is return map?

1 Answers  

---

What is hash data type?

1 Answers  

---

Define a priority queue?

1 Answers  

---

what is the different between B-tree and B+ tree.

8 Answers   Syntel,

---

What is complete binary tree in data structure?

1 Answers  

---

What is heap with example?

1 Answers  

---

Can you tell me the differences between Array and ArrayList?

1 Answers  

---

What is lifo?

4 Answers  

---

Is list same as array?

1 Answers  

---

What is perfect binary tree?

1 Answers  

---

What are the advantages of linked list over an array?

1 Answers  

---