Answer / Khushboo Chauhan

In graph theory, the shortest path between two nodes (vertices) is a path that has the minimum total edge weight. The shortest path problem involves finding such paths.

Does treemap sort automatically?

1 Answers  

---

Explain what is linear search?

1 Answers  

---

Tell me the difference between structure and array?

1 Answers   NIIT,

---

What is the difference between push and pop?

1 Answers  

---

How to pass in data structure exam?

1 Answers  

---

What are stacks? Give some of its applications.

1 Answers   TCS,

---

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

1 Answers  

---

What is difference between rb tree and avl tree?

1 Answers  

---

Explain the uses of b+ tree.

1 Answers  

---

Is array part of collection framework?

1 Answers  

---

Why concurrenthashmap is fail safe?

1 Answers  

---

Explain exception filter?

1 Answers  

---