从尾到头打印链表

题目：输入一个链表的头结点，从尾到头反过来打印出每个结点的值

以后再补充

方法一：非递归的方式  
public class PrintListReverse {  
    public static void main (String args[]) {  
        ListNode node1=new ListNode();  
        ListNode node2=new ListNode();  
        ListNode node3=new ListNode();  
        node1.data=1;  
        node2.data=2;  
        node3.data=3;  
        node1.next=node2;  
        node2.next=node3;  
        printListReversversingly test=new printListReversversingly();  
        test.printListReverse(node1);  
    }  
    public static void printListReverse(ListNode headNode) {  
        Stack<ListNode> stack=new Stack<ListNode>();  
        while(headNode!=null) {  
            stack.push(headNode);  
            headNode=headNode.next;  
        }  
        while(!stack.isEmpty()) {  
            System.out.println(stack.pop().data);  
        }  
    }  
}  
方法二: :  
递归方式实现  
public class PrintListReverse {  
    public static void main (String args[]) {  
        ListNode node1=new ListNode();  
        ListNode node2=new ListNode();  
        ListNode node3=new ListNode();  
        node1.data=1;  
        node2.data=2;  
        node3.data=3;  
        node1.next=node2;  
        node2.next=node3;  
        printListReversversingly test=new printListReversversingly();  
        test.printListReverse(node1);  
    }  
    public static void printListReverse(ListNode headNode) {  
        if(headNode!=null) {  
            if(headNode.next!=null) {  
                printListReverse(headNode.next);  
            }  
        }  
        System.out.println(headNode.data);  
    }  
}