Latest josh technology Aptitude Question SOLUTION: #include struct node { int value ; struct node *next; }; /*void fun(int *p) { int q=10; printf("function %d\n",*p); p=&q; printf("function %d\n",*p);

• Placement Papers
• /
• josh technology
• /
• Programming

josh technology Question Papers:

(#M40154178) JOSH TECHNOLOGY Programming question ans Keep an EYE

#include
struct node
{
int value ;
struct node *next;

};
/*void fun(int *p)
{
int q=10;
printf("function %dn",*p);
p=&q;
printf("function %dn",*p);
}*/
void rearrange(struct node *list)
{
struct node *p,*q;
int temp;
if((!list)||!list->next)
return;
p=list;
q=list->next;
while(q)
{
temp=p->value;
p->value=q->value;
q->value=temp;
p=q->next;
q=p?p->next:0;

}
}

Asked In josh technology Deepak Singh (8 years ago)

Unsolved Read Solution (4)

Is this Puzzle helpful?   (34)   (15) Submit Your Solution