Print in Reverse

1. 문제

2. 알고리즘

키워드 - 구현, 출력

3. 코드

/*
  Print elements of a linked list in reverse order as standard output
  head pointer could be NULL as well for empty list
  Node is defined as 
  struct Node
  {
     int data;
     struct Node *next;
  }
*/
void ReversePrint(Node *head)
{
  // This is a "method-only" submission. 
  // You only need to complete this method. 
    if(head != NULL) {
        ReversePrint(head->next);
        cout << head->data << endl;
    }
}