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 are the major data structures used in the network data model?

1023

What is a multidimensional array?

879

Write a program using mergesort technique.

936

How to cut or remove an element from the array?

920

What is the use of data structure?

874

What is a string or array type?

763

Mention some drawbacks of the linked list.

914

Is queue fifo or lifo?

837

Is map a data structure?

870

Why do we need a data structure?

931

What is array and structure?

927

What do you mean by balance factor of a node in avl tree?

868

Can we put null value in hashmap?

817

What is the best case for bubble sort?

805

What is an array vs list?

812