Answer / Alok Sharma

The shortest path is the path between two vertices in a graph with the smallest total edge weight or length. In an unweighted graph, the shortest path is just the path with the minimum number of edges.

State the advantages of using infix notations?

1 Answers  

---

Differentiate between failfast and failsafe.

1 Answers  

---

Is a hash table a map?

1 Answers  

---

What are the average and worst time complexity in a sorted binary tree is

1 Answers   TCS,

---

Describe the level term in a tree.

1 Answers  

---

Is arraylist fail fast?

1 Answers  

---

How can a binary tree be represented using the rotation?

1 Answers  

---

What are all the classes and interfaces that are available in the collections?

1 Answers  

---

How to find the missing element in integer array of 1 to 7?

1 Answers  

---

What do u mean by array?

1 Answers  

---

What is a b+ tree? Explain its uses.

1 Answers  

---

Explain the uses of binary tree.

1 Answers  

---