create an singly linked lists and reverse the lists by
interchanging the links and not the data?
- 13 Answers
- 16471 Views
- Microsoft, TCS, I also Faced
- E-Mail Answers
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;
}
| Is This Answer Correct ? | 2 Yes | 0 No |
Post New Answer View All Answers
Does arraylist have index?
What is an ordered map?
Define balancing condition for AVL Tree.
Define in brief an array.
Why hashtable is faster than arraylist?
What is ascending and descending order?
What is data structure definition?
What is a list in data structure?
What is the space complexity of selection sort?
How do you sort an array in descending order?
What is arrays copyof?
Can we define the size of arraylist?
If you have to store one lakh objects, what will be a better option- a hash map or an array list?
What are common data structures?
What is the best complexity of bubble sort?
