1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73
|
#include <stdio.h>
struct node
{
struct node *p_next;
int data;
};
static void display(struct node *p)
{
if (p != NULL)
{
printf ("'%c' ", p->data);
display(p->p_next);
}
else
{
printf ("NIL\n");
}
}
static struct node *reverse(struct node *p)
{
struct node *p_rev = NULL;
while (p != NULL)
{
struct node *p_next = p->p_next;
if (p_rev == NULL)
{
p->p_next = NULL;
}
else
{
p->p_next = p_rev;
}
p_rev = p;
p = p_next;
}
return p_rev;
}
int main ()
{
struct node a[] =
{
{
a + 1, 'A'
},
{
a + 2, 'Z'
},
{
a + 3, 'E'
},
{
a + 4, 'R'
},
{
a + 5, 'T'
},
{
NULL, 'Y'
},
};
struct node *p = a;
display(p);
p = reverse(p);
display(p);
return 0;
} |
Partager