java 实现有序链表

package Algorithmic;

public class Test {

    public static void main(String[] args) {
        //头插法将1-10十个数字，10作为头，存放进链表中
      Node node1 =   new Node(1);
      for(int i=2;i<11;i++){
          Node node2= new Node(i, node1);
          node1 = node2;
      }

      //此时最后一个被加入的元素是10，那么第一个元素就是10
      printNode(node1);
    }

    public static void printNode(Node node){
        while (node!=null){
            System.out.println(node.getData()+" ");
            node = node.getNext();
        }
    }

    
}

class Node{
    private int data;
    private Node next;

    public Node() {

    }

    public Node(int data,Node next) {
        this.data = data;
        this.next = next;
    }

    public Node(int data){
        this(data,null);
    }

    public int getData() {
        return data;
    }

    public Node getNext() {
        return next;
    }
}

反转链表：

p