gangadhara15
BAN USER
Comments (3)
Reputation -5
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
-1
of 1 vote
{Algorithm}
struct Node
{
int data;
struct Node *next;
};
struct Node *root;
p1=p2=root; //Initially both pointers pointing to the same location
int temp;
while(p2=p2->next)
{
temp=p2->data;
p2->data=p1->data;
p1->data=temp;
if(p2=p2->next)
{
p1=p2;
}
else
return;
}
Comment hidden because of low score. Click to expand.
0
of 0 vote
{{{ {Algorithm}
p1=p2=root; //Initially both pointers pointing to the same location
int temp;
while(p2=p2->next)
{
temp=p2->data;
p2->data=p1->data;
p1->data=temp;
if(p2=p2->next)
{
p1=p2;
}
else
return;
}
-
gangadhara15
July 06, 2013 | Flag
Reply
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
- gangadhara15 August 28, 2013