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

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

Question Posted / mayur bagal

Answer Posted / mayur bagal

struct node{
int data;
node * next;
};

node *pt2=NULL:
while(root!=NULL)
{
node * temp = root->next;
root->next= pt2;
pt2=root;
root = temp;
}

Is This Answer Correct ?

3 Yes

2 No

Please Help Members By Posting Answers For Below Questions

What are the collision resolution methods?

970

What are hash tables good for?

909

What is an object array?

934

Does treeset remove duplicates?

919

Which programming language is best for data structures?

883

What do you understand by stable sort?

879

What is the difference between an array and vector?

1028

Differentiate between comparable and comparator.

1017

What are the disadvantages of linked list?

897

How is heap sort implemented?

825

Which sorting does collections sort use?

890

What is sequential search?

936

When would you use a hashmap?

906

Can sets contain duplicates?

824

Why we use linked list?

903