反转单链表的递归和非递归操作

#include <iostream>
using namespace std;
#define M 7

typedef struct LNode
{
    int data;
    struct LNode *next;
}LNode, * LinkList;

LinkList CreateList(LinkList &L)
{
    L = (LinkList) malloc (sizeof(LNode));
    LNode *r = L, *p;
    for(int i = 0; i < 7; i++)
    {
        p = (LNode *) malloc (sizeof(LNode));
        p -> data = i + 1;
        r -> next = p;
        r = p;
    }
    r -> next = NULL;
    
    return L;
}

void PrintListData(LinkList L)
{
    LNode *p = L -> next;
    
    while(p != NULL)
    {
        cout << p -> data << " ";
        p = p -> next;
    }
    
    cout << endl;
}

LinkList Reverse1(LinkList L)//反转链表常规思路
{
    LNode *p = L -> next, *s;
    L -> next = NULL;
    
    while(p != NULL)
    {
        /*
        s = p;
        p = p -> next;
        s -> next = L -> next;
        L -> next = s;
        */
        
        s = p -> next;
        p -> next = L -> next;
        L -> next = p;
        p = s;
    }
    
    return L;
}

LinkList Reverse2(LinkList L)//反转链表尾链（后一个结点链前一个结点）
{
    LNode *pre, *p = L -> next, *r = p -> next;
    p -> next = NULL;
    
    while(r != NULL)
    {
        pre = p;
        p = r;
        r = r -> next;
        p -> next = pre;
    }
    
    L -> next = p;
    return L;
}

LinkList Reverse3(LinkList L)//反转链表递归 
{                               //一般不带头节点的单链表反转用递归
    LNode *p, *r;
    if(L == NULL || L -> next == NULL)
         return L;
    p = Reverse3(L -> next);//p一直未最后一个结点
    (L -> next) -> next = L;
    L -> next = NULL;
    
    return p;
         
}

int main() {
	LinkList L = NULL;
	CreateList(L);
	
	cout << "反转前：";
	PrintListData(L);
	
	L = Reverse3(L);
	
	cout << "递归反转后：";
	LNode *p = L;
	
	while(p -> next != NULL)
	{
	    cout << p -> data << " ";
	    p = p -> next;
	}
	
	return 0;
}