Data Structure Linked List: Write a function to reverse a linked list

iterative太简单不写了

http://www.geeksforgeeks.org/write-a-function-to-reverse-the-nodes-of-a-linked-list/

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <string>
#include <fstream>
#include <map>
#include <set>
using namespace std;

struct node {
    int data;
    node *next;
    node() : data(0), next(NULL) { }
    node(int d) : data(d), next(NULL) { }
};

void push(node* &head, int k) {
    node *new_node = new node(k);
    new_node->next = head;
    head = new_node;
}

void print(node *head) {
    while (head) {
        cout << head->data << " ";
        head = head->next;
    }
    cout << endl;
}

void reverselist(node *&head) {
    if (!head) return;
    node *cur = head;
    node *next = head->next;
    if (!next) return;
    reverselist(next);
    cur->next->next = cur;
    cur->next = NULL;
    head = next;
}

int main() {
    node *head = NULL;
    push(head, 5);
    push(head, 4);
    push(head, 3);
    push(head, 2);
    push(head, 1);
    print(head);
    reverselist(head);
    print(head);
    return 0;
}