#include #include typedf struct node {int data; struct node * next;} node; void reverse (node * = head-> next; node * f = q; head-> next = null; while (q) {f = q; q = q-> next; f-> Next = head-> next; head-> next = f;}} void main () {int n; node * p, * q; node * head = (node *) malloc (sizeof (node)); head-> data = 0; head-> next = null; scanf ("% d", & n); while (n! = - 1) {p = (node *) malloc (sizeof (node)); p-> data = n; p-> next = null; p-> next = head-> next; head-> next = P; scanf ("% D", & n);} // Reverse (HEAD); P = head-> next;
While (p! = null) {Printf ("% d", p-> data); p = p-> next;}
}
