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

Sort by

recency

|

978 Discussions

|

  • jimenezmyj
     + 0 comments

    Lots off problems with de code given in c#.

  • 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;
}

  • somaditya
     + 0 comments

    simplest python solution:

    def reversePrint(llist):
    if not llist:
        return
        
    reversePrint(llist.next)
    print(llist.data)

  • adadasanyasirao
     + 0 comments
    void reversePrint(SinglyLinkedListNode* head) {
    SinglyLinkedListNode *temp=head;
    int i=0;
    while(temp!=NULL){
        i++;
        temp=temp->next;
    }
    temp=head;
    int arr[i];
    for(int k=0; k<i; k++){
        arr[k]=temp->data;
        temp=temp->next;
    }
    for(int j=i-1; j>=0; j--){
        printf("%d\n",arr[j]);
    }
}

  • evanbechtol
     + 0 comments

    Here is a recursive solution in JavaScript:

    function reversePrint(llist) {
    if (!llist) {
        return;
    }
    
    reversePrint(llist.next)
    console.log(llist.data);    
}