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;

}

When is a binary search best applied?

843

---

Define tree edge?

880

---

What is the difference between data type and data structure?

836

---

What do you mean by shortest path?

1025

---

Write program for Quick sort ?

1061

---

Tell me what is quick sort?

863

---

What is example of data?

1034

---

Which sorting algorithm is best for small data?

832

---

How to print element of Array?

1005

---

What is different between array and list?

893

---

How many types of linked lists are there?

850

---

What is rule regarding overriding equals and hascode method?

882

---

What are linked lists used for?

923

---

What are linked lists good for?

823

---

What are two types of sorting?

973

---