You could do it recursively which is a lot neater. The code below is in Java.

void ReversePrint(Node head) {

if(head == null)
    ;
else{
    ReversePrint(head.next);
    System.out.println(head.data);
}

}