create an singly linked lists and reverse the lists by
interchanging the links and not the data?
- 13 Answers
- 18062 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
Explain the Queue
What is modcount in hashmap?
Define a complete binary tree?
Is quicksort a stable algorithm?
Is vector synchronized?
Define left-in threaded tree?
What is the difference between array and stack?
Is treemap synchronized?
What are the Differences between map and hashmap?
Define right-in threaded tree?
What is map entry?
How do you rotate an AVL tree?
Explain quick sort?
Define tree edge?
Define a tree?
