Answer Posted / salil

This is the same solution as many have given but I have
tried to make it little easier to understand. The reversal
process can be imagined as creating a new list of nodes
coming out of the old list. Assuming that the two lists are
known by their heads oldhead (pointing to the old list) and
new head (pointing to the new list). Basically the steps
involved are:
- move the current node from the old list to the new list
- the new node coming from the old list comes to the head
of the new list
- make the new node point to the head of the new list you
had so far - also means the new node becomes the new head
for the new list
- adjust the heads of the new and old list
- do these steps until the oldhead points to null. of
course, you will need to start with the newhead being null.

reverse(struct node *head)
{
struct node *oldhead,*newhead,*t;
oldhead=head;
newhead= NULL;
while(oldhead!=NULL)
{
t=newhead; (save current newhead)
newhead=oldhead; (newhead now points to current
node from old list)
oldhead=oldhead->next; (move oldhead forward)
newhead->next=t; (make new node point to head
of the new list so far)
}
head=newhead;

}

For searches. Which one is most preferred: array list or linked list?

930

---

What is hash value of a string?

884

---

Which data structure is used in arraylist?

1000

---

Name some applications which use linked lists.

989

---

How would you dynamically allocate a one-dimensional and two-dimensional array of integers?

978

---

What is 2 dimensional linked list?

1000

---

What is m way tree in data structure?

1055

---

What are the 3 types of variables?

879

---

What differences exist between hashmap and hashtable?

975

---

List out the applications of a linked list?

874

---

Define in brief an array.

924

---

Explain the implementation of an AVL tree and Binary tree.

937

---

What are binary trees?

1556

---

What are linear and non linear data structures?

850

---

What sort does arrays sort use?

859

---