sword05-逆序打印链表

5. 输入一个链表的头节点，从尾到头打印每个节点的值

   ANY：
   1、递归大法
   2、利用栈的特性

   public class Sword05 {
   
       public static void main(String[] args) {
           Node<String> node1 = new Node<>("A");
           Node<String> node2 = new Node<>("B");
           Node<String> node3 = new Node<>("C");
           Node<String> node4 = new Node<>("D");
           Node<String> node5 = new Node<>("E");
           Node<String> node6 = new Node<>("F");
           node1.setNext(node2);
           node2.setNext(node3);
           node3.setNext(node4);
           node4.setNext(node5);
           node5.setNext(node6);
           reverseOut02(node1);
           reverseOut03(node1);
   
       }
   
       private static void reverseOut02(Node node) {
           if (node.getNext() != null) {
               reverseOut02(node.getNext());
           }
           System.out.println(node.getVal());
       }
   
       private static void reverseOut03(Node node) {
           if (node == null) {
               return;
           }
           Stack stack = new Stack();
           while (node != null) {
               stack.add(node.getVal());
               node = node.getNext();
           }
           while (!stack.isEmpty()) {
               System.out.println(stack.pop());
           }
       }
   }