struct node{ int data; node * next; }; node *pt1,*pt2=NULL: while(root

create an singly linked lists and reverse the lists by
interchanging the links and not the data?

Question Posted / vijayan

Answer Posted / vijayan

struct node{
int data;
node * next;
};
node *pt1,*pt2=NULL:
while(root!=NULL)
{
pt1=root;
root=root->next;
pt1->next=pt2;
pt2=pt1;
}

Is This Answer Correct ?

31 Yes

3 No

Please Help Members By Posting Answers For Below Questions

What is the slowest sorting algorithm?

898

How to find the missing element in integer array of 1 to 7?

942

Define an algorithm.

962

What is the difference between a hashmap and hashtable?

807

What is the application of queue?

892

Does concat mutate array?

906

Explain what are the methods available in storing sequential files ?

921

What is difference between an Array and ArrayList?

999

What are the disadvantages of representing a stack or queue by a linked list?

919

Have you ever used HashTable and Directory?

975

What is basic data structure?

888

When would you use a hashmap?

906

Is an arraylist a vector?

955

What is difference between while and do while?

863

What is ds heap sort?

899