Western Governors University (WGU) ICSC2100 C949 Data Structures and Algorithms I Practice Exam

In a linked list, new nodes are typically added by using pointers to connect nodes. A linked list is a data structure that consists of a sequence of nodes, where each node contains data and a pointer (or reference) to the next node in the sequence. When inserting a new node, you first create the node and then adjust the pointers to include the new node in the list.

For example, if you want to add a new node after a certain existing node, you would set the new node's pointer to point to the next node in the list, and then update the existing node's pointer to point to the new node. This process effectively links the new node into the list without needing to overwrite any existing nodes or remove any components of the list. The use of pointers is what allows for dynamic memory allocation and the flexibility of the linked structure, making it possible to efficiently add nodes at any position without having to shift other nodes around, as would be the case in an array.

The other options involve methods or concepts that do not apply to linked lists in this context.