create an singly linked lists and reverse the lists by
interchanging the links and not the data?
- 13 Answers
- 17255 Views
- Microsoft, TCS, I also Faced
- E-Mail Answers
Answer Posted / sumit garg( jmit mca)
\\HELLO FRIENDS CHEK THIS...IT IS TESTED\\
struct node
{
int info;
struct node * next;
};
struct node * ptr=NULL,* old=NULL,*save=NULL;
void reverse()
{
old=ptr=start;
while (ptr!=NULL)
{
ptr=ptr->next;
old->next=save;
push(old);
save=old;
old=ptr;
}
}
void push(struct node * p)
{
top++;
stack [top]=p;
}
struct node * pop()
{
struct node * ret=NULL;
ret=stack[top];
top=top-1;
return ret;
}
display(struct node * disp)
{
disp=stack[top];
while (disp->next!=NULL)
{
disp=pop();
printf("%d",disp->info);
}
| Is This Answer Correct ? | 2 Yes | 3 No |
Post New Answer View All Answers
Write code for reversing a linked list.
What are common data structures?
Define right-in threaded tree?
Sorting is not possible by using which of the methods?
What is collection sort?
State the difference between primitive and non-primitive data types?
Explain singly linked list in short.
Is array size dynamic or fixed?
Tell me what should be done in the base case for this recursive problem?
what is Singly Linked list?
Can we extend an array after initialization?
Why linked lists are better than arrays?
What is collision in data structure?
What should I learn first data structures or algorithms?
Which algorithm is used in collections sort method?
