can i know the source code for reversing a linked list with
out using a temporary variable?
Answers were Sorted based on User's Feedback
#include<stdio.h>
struct node *head;
void main();
{
//consider head is the first node
reverse(head);
//here print the reversed link list ...thank you;
}
reverse(struct node *cur)
{
if(cur->next==NULL)
reveres(cur->next)
else{temp=head=cur;}
temp->next=cur;
temp=temp->next;
temp->next=NULL;
}
| Is This Answer Correct ? | 2 Yes | 1 No |
Answer / vishnu948923
struct node* reverse(struct node* first)
{
struct node* cur, temp;
cur=NULL;
while(first!=NULL)
{
temp=first;
first=first->link;
temp->link=cur;
cur=temp;
}
return cur;
}
| Is This Answer Correct ? | 5 Yes | 5 No |
Answer / ruchi
void reverse()
{
nptr p;
int i=0;
p=start;
while(p->next!=NULL)
{
p=p->next;
i=i+1;
}
i++;
while(i)
{
printf("%d\n",p->num);
p=p->prev;
i--;
}
}
| Is This Answer Correct ? | 1 Yes | 1 No |
Answer / fazil
void Func( struct Node* List )
{
if( List && List->Next )
{
Func( List->Next );
List->Next->Next = List;
}
}
| Is This Answer Correct ? | 2 Yes | 3 No |
Answer / zhangwy
void Func( struct Node* List )
{
if( List && List->Next )
{
Func( List->Next );
List->Next->Next = List;
List->next = NULL ;
}
}
| Is This Answer Correct ? | 0 Yes | 1 No |
Answer / abdur rab
struct node* reverse ( struct node* head )
{
struct node* temp;
if ( NULL == head -> next ) temp = head;
else {
temp = reverse ( head -> next );
head -> next -> next = head;
head -> next = NULL;
}
return ( temp );
}
| Is This Answer Correct ? | 0 Yes | 3 No |
In which category does main function belong??
write a program to compare 2 numbers without using logical operators?
Explain a pre-processor and its advantages.
Write a program to print fibonacci series using recursion?
Write a function expand(s1,s2) that expands shorthand notations like a-z in the string s1 into the equivalent complete list abc...xyz in s2 . Allow for letters of either case and digits, and be prepared to handle cases like a-b-c and a-z0-9 and -a-z. z-a:zyx......ba -1-6-:-123456- 1-9-1:123456789987654321 a-R-L:a-R...L a-b-c:abbc
develop algorithms to add polynomials (i) in one variable
Can you define which header file to include at compile time?
a single linked list consists of nodes a to z .print the nodes in reverse order from z to a using recursion
what is the hardware model of CFG( context free grammar)
What is #define?
Explain how can I remove the trailing spaces from a string?
What is the use of bit field?