单向链表的Java实现

一、链表的简单实现

package test01;

/*
 * 单向链表的简单实现
 * */

class Node{
    private String data;
    private Node next;
    public Node(String data){
        this.data = data;
    }
    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;
    }
}

public class LianBiao {

    public static void main(String[] args) {
        Node n0 = new Node("A");
        Node n1 = new Node("B");
        Node n2 = new Node("C");
        n0.setNext(n1);
        n1.setNext(n2);
        Print(n0);
    }

    private static void Print(Node n0) {
        System.out.println(n0.getData());
        if(n0.getNext() != null){
            Print(n0.getNext());
        }
        
    }

}

二、链表的正宗实现

package test02;

/*
 * 单向链表的正宗实现
 * */

class Link{
    class Node{
        private String data;
        private Node next;
        public Node(String data){
            this.data = data;
        }
        public void addNode(Node newNode){
            if(this.next == null){
                this.next = newNode;
            }else{
                this.next.addNode(newNode);
            }
        }
        public void printNode(){
            System.out.println(this.data);
            if(this.next != null){
                this.next.printNode();
            }
        }
    }
    Node root;
    public void add(String data){
        Node newNode = new Node(data);//第一步就是生成节点，接下来就可以参考链表的简单实现方法
        if(this.root == null){
            this.root = newNode;
        }else{
            this.root.addNode(newNode);
        }
    }
    public void printnode(){
        this.root.printNode();
    }
}

public class LianBiao01 {

    public static void main(String[] args) {
        Link l = new Link();
        l.add("ROOT");
        l.add("A");
        l.add("B");
        l.add("C");
        l.printnode();
    }
}