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;

}

Does hashmap maintain insertion order?

969

---

Will arraylist maintain insertion order?

962

---

What are the complexity of binary search?

989

---

How do you sort an arraylist in descending order?

835

---

What does quick sort do?

931

---

Does arraylist maintain insertion order?

875

---

Define degree of the node?

1045

---

What is stack algorithm?

912

---

What is unbounded queue?

966

---

What is adt and its advantages?

1096

---

When new data are to be inserted into a data structure?

963

---

What is the structure of an array?

954

---

Can you provide some implementation of a dictionary having large number of words?

1153

---

What is the default value of Array?

1185

---

What can be stored in an arraylist?

1016

---