Intrusive Linked Lists
Intrusive Linked Lists is a data structure in which the linkage metadata, such as pointers to adjacent nodes, is embedded directly within the data elements themselves, thereby distinguishing it from non-intrusive linked lists where the linking information is maintained separately from the stored data.
0
Publications
0
Citations
0
Authors
0
Institutions
Parents