java数据结构和算法------线性表(链表结构)

package iYou.neugle.list;

// 链表数据结构
public class Node<T> {
    // 该节点的值
    public T data;
    // 该节点指向的下一个节点
    public Node<T> next;
}

package iYou.neugle.list;

public class MyChainList<T> {
    // 向链表尾部添加元素
    public Node<T> AddEnd(Node<T> head, T data) {
        Node<T> node = new Node<T>();
        node.data = data;
        if (head == null) {
            head = node;
            return head;
        }
        SearchEnd(head).next = node;
        return head;
    }

    private Node<T> SearchEnd(Node<T> head) {
        if (head.next == null) {
            return head;
        }
        return SearchEnd(head.next);
    }

    // 向链表头部添加元素
    public Node<T> AddHead(Node<T> head, T data) {
        Node<T> node = new Node<T>();
        node.data = data;
        Node<T> nodeCopy = DeepCopy(head, new Node<T>());
        node.next = nodeCopy;

        head.data = node.data;
        head.next = node.next;
        return head;
    }

    private Node<T> DeepCopy(Node<T> head, Node<T> node) {
        if (head != null) {
            node.data = head.data;
            node.next = head.next;
        } else {
            return null;
        }
        DeepCopy(head.next, node.next);
        return node;
    }

    // 向链表中插入数据
    public Node<T> Insert(Node<T> head, T key, T data) {
        if (head.next == null) {
            return null;
        }

        if (head.data.equals(key)) {
            return AddHead(head, data);
        }

        if (head.next.data.equals(key)) {
            Node<T> node = new Node<T>();
            node.data = data;
            node.next = head.next;
            head.next = node;
            return head;
        }
        Insert(head.next, key, data);
        return head;
    }

    // 向链表中删除数据
    public Node<T> Delete(Node<T> head, T key) {
        if (head.next == null) {
            return null;
        }

        if (head.data.equals(key)) {
            head.data = head.next.data;
            head.next = head.next.next;
            return head;
        }

        if (head.next.data.equals(key)) {
            head.next = head.next.next;
            return head;
        }
        Delete(head.next, key);
        return head;
    }

    // 按关键字查找节点
    public void Search(Node<T> head, T key) {
        if (head.data.equals(key)) {
            System.out.println("查询节点为头结点,节点值为:" + key);
            return;
        }
        while (head.next != null) {
            if (head.next.data.equals(key)) {
                System.out.print("查询节点为:" + key + ",");
                System.out.print("查询节点前置节点为:" + head.data + ",");
                if (head.next.next != null) {
                    System.out.println("查询节点后置节点为:" + head.next.next.data);
                } else {
                    System.out.println("查询节点为尾节点!");
                }
                return;
            }
            head = head.next;
        }
        System.out.println("没有该节点!");
    }

    // 获取链表长度
    public int SizeOf(Node<T> head) {
        // 如果没有节点,返回-1
        if (head == null) {
            return -1;
        }
        int n = 1;
        while (head.next != null) {
            n++;
            head = head.next;
        }
        return n;
    }

    public void Print(Node<T> head) {
        while (head != null) {
            System.out.println(head.data);
            head = head.next;
        }
    }
}