create an singly linked lists and reverse the lists by
interchanging the links and not the data?
- 13 Answers
- 16554 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
What is the time complexity of hashmap get () and put () method?
State the properties of a binary tree?
What does the dummy header in the linked list contain?
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
What are the advantages of data structure?
How many types of data structures are there?
Define shortest path?
Define biconnectivity?
State the demerits of linked representation of binary trees?
What is type structure?
What does arrays tostring do?
List the types of tree.
What is peek in stack?
What is the difference between array sort () and array sort t >()?
Differentiate stack from array?
