We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Print in Reverse
  5. Discussions

Print in Reverse

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the vidéo explanation here : https://youtu.be/WO7Uz7sQML4

    void reversePrint(SinglyLinkedListNode* llist) {
    if(llist == nullptr) return;
    reversePrint(llist->next);
    cout << llist->data << endl;
}