问题描述:
从尾到头打印单链表
代码实现:
void PrintTialToHead(pSListNode pHead)
{
pSListNode end = NULL;
while (pHead != end)
{
pSListNode cur = pHead;
while (cur->_next!= end)
{
cur = cur->_next;
}
printf("%d-->", cur->_data);
end = cur;
}
printf("NULL\n");
}
//2、从尾到头打印单链表(递归实现) 时间复杂度为O(n)
void PrintTialToHeadR(pSListNode pHead)
{
if (pHead == NULL)
return;
PrintTialToHeadR(pHead->_next);
printf("%d ", pHead->_data);
}