剑指off-从尾到头打印

//从尾到头打印链表
struct ListNode
{
string key;
ListNode* next;
};
bool printlistreversingly(ListNode* pHead)
{
if (pHead==NULL) {
return false;
}
stack<string> sk;
while (pHead!=NULL) {
sk.push(pHead->key);
pHead=pHead->next;
}

while (sk.empty()==0) {
printf("%s\n",sk.top().c_str());
sk.pop();
}
return true;
}