create an singly linked lists and reverse the lists by
interchanging the links and not the data?
- 13 Answers
- 18063 Views
- Microsoft, TCS, I also Faced
- E-Mail Answers
Answer Posted / bhanu yadav
reverse(node *first) //first address of first node in linked
{ node *x,*temp,*ttemp;
temp=first; //temp at first
ttemp=temp->next; //ttemp next to temp
while(temp->next!=null)
{ x=ttemp->next;
ttemp->next=temp;
temp=ttemp;
ttemp=x;
}
}
| Is This Answer Correct ? | 3 Yes | 1 No |
Post New Answer View All Answers
What is binary tree example?
How do you explain bubble sort?
What is meant by hashing?
What are the 3 types of variables?
Is stack a dynamic data structure?
Explain what are the major data structures used in the rdbms?
Explain what are the notations used in evaluation of arithmetic expressions using prefix and postfix forms?
Define degree of the node?
How can you insert a node in a random location of the linked list?
What is difference between while and do while?
Describe stack operation.
Explain in brief a linked list.
Which sort algorithm is best?
Which is faster hashmap or hashset?
Explain binary tree traversals?
