Answer / Sunil Tiwari

A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible. To check if a binary tree is complete, we need to traverse it and check if it meets this definition.

What are hashmaps good for?

1 Answers  

---

List the types of rotations available in splay tree?

1 Answers  

---

Differentiate between collection and collections.

1 Answers  

---

Why is arraylist used?

1 Answers  

---

Is heap sort adaptive?

1 Answers  

---

Is treemap synchronized?

1 Answers  

---

Can map contain duplicate keys?

1 Answers  

---

How do you find the index of an element in an arraylist?

1 Answers  

---

Parenthesis are never needed in prefix or postfix expressions. Why?

13 Answers   BPO, Microsoft,

---

Is quicksort a stable sorting algorithm?

1 Answers  

---

What are the different types of data type?

1 Answers  

---

How do you use merge sort?

1 Answers  

---