Interview Question for Software Development Engineer Co-op at Amazon.com:

Apr 30, 2012

void printLLreverse(Node *headNode)
{
    //this is going to just iterate through the LL
    //add each element to a stack and
    //print the stack when we are finished
    stack <int> llStack;
    Node* currNode = headNode;
    while(currNode)
    {
        llStack.push(currNode->data);
        currNode = currNode->next;
    }
    while(llStack.size() > 0)
    {
        cout << llStack.top();
        llStack.pop();
    }
}