Answer / Ravi Prakash Srivastava

A path in a graph is a sequence of nodes such that each pair of consecutive nodes are connected by an edge. In other words, it's a series of steps from one node to another without repeating any node or stepping off the graph.

In what areas do data structures applied?

1 Answers  

---

Is Arraylist faster than Array? Why?

1 Answers   QuestPond,

---

Are hash tables ordered?

1 Answers  

---

Define red-black trees.

1 Answers   Wipro,

---

How do you do a mergesort?

1 Answers  

---

What is the height of binary tree?

1 Answers  

---

How would you implement two stacks using a single array?

1 Answers   TCS,

---

What is difference between array and arraylist? When will you use array over arraylist?

1 Answers  

---

Which collection class is thread safe?

1 Answers  

---

Parenthesis is never required in postfix or prefix expressions, why?

1 Answers  

---

Explain the common uses of threaded binary tree.

1 Answers  

---

What are the disadvantages of circular list?

1 Answers  

---