面试题：从尾到头打印链表

/*
链表节点定义如下：
struct ListNode
{
int _data;
ListNode* _next;
};
*/

void PrintListTailToHead(ListNode* phead)
{
assert(phead);

stack<ListNode*> s;
ListNode* cur = phead;
while (cur)
{
s.push(cur);
cur = cur->_next;
}

while (!s.empty())
{
cout<<s.top()->_data<<" ";
s.pop();
}
cout<<endl;
}

void PrintListTailToHead(ListNode* phead)
{
if (phead == NULL)
{
return;
}

PrintListTailToHead(phead->_next);

cout<<phead->_data<<" ";
}