从尾到头打印单链表

• 解决这个问题有两种方法：

---

1.非递归
2.递归

• 算法如下

void SListPrintTailToHead(SListNode* pHead)//非递归
{

    SListNode* tail = NULL;
    while (pHead != tail)
    {
        SListNode* cur = pHead;
        while (cur->_next != tail)
        {
            cur = cur->_next;
        }
        printf("%d ", cur->_data);
        tail = cur;
    }
    printf("\n");
}
void SListPrintTailToHeadR(SListNode* pHead)//递归
{
    if (pHead == NULL)
        return;
    SListPrintTailToHeadR(pHead->_next);
    printf("%d ", pHead->_data);

}
void TestSListPrintTailToHead()
{
    SListNode* list = NULL;
    SListPushBack(&list, 1);
    SListPushBack(&list, 2);
    SListPushBack(&list, 3);
    SListPushBack(&list, 4);
    SListPushBack(&list, 5);

    SListPrintTailToHead(list);
    SListPrintTailToHeadR(list);
}

• 测试结果：