在java中序列化/反序列化自定义链表的正确方法？

import java.io.*;

class Node implements Serializable {
    int data;
    Node next;

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

class LinkedList implements Serializable {
    Node head;

    public LinkedList() {
        this.head = null;
    }

    // 添加节点到链表尾部
    public void addNode(int data) {
        Node newNode = new Node(data);

        if (head == null) {
            head = newNode;
        } else {
            Node current = head;
            while (current.next != null) {
                current = current.next;
            }
            current.next = newNode;
        }
    }
}

public class Main {
    public static void main(String[] args) {
        // 创建链表并添加节点
        LinkedList list = new LinkedList();
        list.addNode(1);
        list.addNode(2);
        list.addNode(3);

        // 序列化链表
        try {
            FileOutputStream fileOut = new FileOutputStream("list.ser");
            ObjectOutputStream out = new ObjectOutputStream(fileOut);
            out.writeObject(list);
            out.close();
            fileOut.close();
            System.out.println("链表已序列化");
        } catch (IOException e) {
            e.printStackTrace();
        }

        // 反序列化链表
        LinkedList deserializedList = null;
        try {
            FileInputStream fileIn = new FileInputStream("list.ser");
            ObjectInputStream in = new ObjectInputStream(fileIn);
            deserializedList = (LinkedList) in.readObject();
            in.close();
            fileIn.close();
            System.out.println("链表已反序列化");
        } catch (IOException | ClassNotFoundException e) {
            e.printStackTrace();
        }

        // 打印反序列化后的链表
        Node current = deserializedList.head;
        while (current != null) {
            System.out.print(current.data + " ");
            current = current.next;
        }
    }
}