#import <Foundation/Foundation.h>

typedef struct Node{
    int data;
    Node *next;
} Node, *List;

Node *revert(Node *head) {
    Node *next = head->next;
    if (next == NULL) {
        return head;
    }
    Node *result = revert(next);
    next->next = head;
    return result;
}

int main(int argc, const char * argv[]) {
    @autoreleasepool {
        Node *head = new Node();
        head->data = 0;
        head->next = NULL;
        Node *current = head;
        for (int i = 1; i < 10; i++) {
            Node *node = new Node();
            node->data = i;
            node->next = NULL;
            current->next = node;
            current = node;
        }

        Node *revertNode = revert(head);
        head->next = NULL;
        current = revertNode;
        while (current != NULL) {
            printf("%d \n", current->data);
            current = current->next;
        }
    }
    return 0;
}