Can you explain to me how a linked list works with FILE I/O. For example, how do you add, modify, delete, and search for a student record in a file after you have written a linked list to it using fwrite?
Traditional use of a linked list involves data that is loaded into memory. When such a list is saved to disk, it is not stored as a linked list. The advantage of a linked list is the flexibility it provides for arranging items. Most of these advantages are lost when data is stored on disk. There are some linked list schemes that work on disk-based data, but they require a complex file arrangement and are not compatible with linked lists in memory.