Print in Reverse HackerRank

 public static void reversePrint(SinglyLinkedListNode head) {

            Stack <Integer> stack=new Stack<Integer>();

            SinglyLinkedListNode temp=head;

            while(temp!=null){

                stack.push(temp.data);

                temp=temp.next;

                           

            }

           while(!stack.isEmpty()){

                System.out.println(stack.pop());

            }

            // Write your code here*/

    }