In C, intrusive or embedded linked lists embed the list pointers inside the user data structure, typically used for what purpose?

• A. To avoid per-element wrapper allocations and improve performance in kernel data structures.
• B. To ensure that the list can store different data types via polymorphism.
• C. To simplify memory management by using static allocation.
• D. To automatically serialize the list for I/O.

Answer: (A)

Intrusive or embedded linked lists rely on placing the list pointers right inside the element itself, so each item is its own node. This approach is used to avoid extra wrapper allocations for every element, which cuts memory overhead and speeds up operations in data structures that manage many small items, such as kernel lists. By eliminating a separate node allocation, insertion and removal become cheaper and the element’s data stays close to its linkage, improving cache locality. In addition, you can put multiple linkage fields in the same object to participate in different lists without creating separate wrapper nodes. Of course, this requires careful lifetime management and awareness that the object's layout is tied to the list implementation.

The other ideas don’t fit because embedding links isn’t about polymorphism or storing different types, it doesn’t rely on static allocation, and it isn’t about serializing the list for I/O.