从尾到头打印链表

题目：输入一个链表的头结点，从尾到头反过来打印出每个结点的值。

struct ListNode
{
    int  m_nKey;
    ListNode *m_pNext;
};

void PrintListReverse(ListNode *pHead)
{
	std::stack<ListNode*> nodes;

	ListNode *pNode = pHead;
	while(pNode != NULL)
	{
		nodes.push(pNode);
		pNode = pNode->m_pNext;
	}

	while(!nodes.empty())
	{
		pNode = nodes.top();
		printf("%d\t" , pNode->m_nValue);
		nodes.pop();
	}
}

void PrintListReversely(ListNode* pListHead)
{
      if(pListHead != NULL)
      {
            // Print the next node first
            if (pListHead->m_pNext != NULL)
            {
                  PrintListReversely(pListHead->m_pNext);
            }

            // Print this node
            printf("%d", pListHead->m_nKey);
      }
}