Answer / Aftab Alam

1. Traverse left subtree by recursively calling the function for the left child.
2. Visit the node (perform some task like printing its data).
3. Traverse right subtree by recursively calling the function for the right child.

Explain the difference between hashset and hashmap?

1 Answers  

---

What is the two-dimensional array?

1 Answers  

---

Explain what is the type of the algorithm used in solving the 8 queens problem?

1 Answers  

---

What are the topics in data structures?

1 Answers  

---

Why arraylist is not efficient for manipulation?

1 Answers  

---

difference between the run time polymorphism and compile time poly morphism and about virtual function.

2 Answers   CybAge, Innowe, TCS, Wipro,

---

Can hashmap have duplicate keys?

1 Answers  

---

What is sorting an array?

1 Answers  

---

What is a Breadth First Search? Give a few of its applications.

1 Answers   Ciena,

---

Which language is best to learn data structures?

1 Answers  

---

Provide an algorithm to reverse a linked list without using recursion.

1 Answers   Wipro,

---

How do you implement a stack?

1 Answers  

---