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

  • emhhacker
     + 0 comments

    My Java solution with linear time complexity and constant space complexity using recursion:

    public static void reversePrint(SinglyLinkedListNode llist) {
        if(llist == null) return;
        
        reversePrint(llist.next);
        
        System.out.println(llist.data);
    }