This is a more efficient version of the program given in ans 2. p=head;

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

Question Posted / jishu

13 Answers
19801 Views
Microsoft, TCS, I also Faced
E-Mail Answers

Answer Posted / jishu

This is a more efficient version of the program given in ans 2.

p=head;
result=NULL;

while(p!=NULL)
{
temp=p->next;

p->next=result;
result=p;

p=temp;

}

Is This Answer Correct ?

2 Yes

1 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

What is frozenset?

839

Which is the parent class of abstractsequentiallist class?

855

List out the basic operations that can be performed on a stack?

841

What do you mean by garbage collection?

888

How do you sort a map by key?

801

What is data type explain?

1032

How do I use quick sort?

802

Define graph traversals?

932

State the advantages of using infix notations?

1122

What is the use of hashtable?

825

Explain set interface?

968

What is the most used data structure?

845

What data structure underlies a python list?

886

What is breadth first tree?

947

Which is the parent class of list class?

851