create an singly linked lists and reverse the lists by
interchanging the links and not the data?
- 13 Answers
- 16502 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
What are the disadvantages array implementations of linked list?
What is dynamic array with example?
What is list and its types?
What is a multidimensional array?
Differentiate between hashmap and treemap.
What are the issues that hamper the efficiency in sorting a file?
What are the types of collision resolution strategies in open addressing?
What is breadth first tree?
Differentiate between arraylist and linkedlist.
How many links are there in a binary tree of N nodes?
Which sorting has less time complexity?
What is raid (redundant array of inexpensive disks)?
What are the tasks performed during inorder traversal?
What are common data structures?
Differentiate between queue and deque.
