Java实现一个类似链表的结构，从尾到头打印输出

用java实现一个类似链表的结构，并能反序打印遍历。
实现代码：

public class No5 {

    static class Node{
        String data;
        Node next;
        public Node(String data){
            super();
            this.data = data;
        }
        public Node(String data, Node next){
            super();
            this.data = data;
            this.next = next;
        }
        public String getData() {
            return data;
        }
        public void setData(String data) {
            this.data = data;
        }
        public Node getNext() {
            return next;
        }
        public void setNext(Node next) {
            this.next = next;
        }


    }
    //递归反转
    private static Node reverse(Node head){
        if(head.next == null){
            return head;
        }
        Node reverseHead = reverse(head.next);
        head.getNext().setNext(head);
        head.setNext(null);
        return reverseHead;
    }
    //非递归
    private static Node reverse2(Node head){
        Node pre = head;
        Node cur = head.getNext();
        Node temp;
        while(cur != null){
            temp = cur.getNext();
            cur.setNext(pre);
            pre = cur;
            cur = temp;
        }
        head.setNext(null);
        return pre;
    }
    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO 自动生成的方法存根
        Node node1=new Node("A");
        Node node2=new Node("B");
        Node node3=new Node("C");
        Node node4=new Node("D");
        Node node5=new Node("E");
        node1.setNext(node2);
        node2.setNext(node3);
        node3.setNext(node4);
        node4.setNext(node5);
        Node newNode=reverse2(node1);
        while(newNode!=null){
            System.out.print(newNode.data+" ");
            newNode=newNode.getNext();
        }
    }

}