During a sorted insertion algorithm for an ordered linked list, which pointer is used to traverse the list?

During a sorted insertion algorithm for an ordered linked list, which pointer is used to traverse the list?

• A. current
• B. trailCurrent
• C. head
• D. tail

Answer: (A)

During sorted insertion in an ordered linked list, you walk from node to node to find where the new value fits. The pointer that does this walking is current, which points to the node you’re inspecting at each step. You start with current at the head and advance it by current = current.next until you find the correct spot. A trailCurrent pointer may be used to remember the node before current so you can insert between them, but the actual traversal relies on current. The head simply marks the start of the list, and tail marks the end.

During sorted insertion in an ordered linked list, you walk from node to node to find where the new value fits. The pointer that does this walking is current, which points to the node you’re inspecting at each step. You start with current at the head and advance it by current = current.next until you find the correct spot. A trailCurrent pointer may be used to remember the node before current so you can insert between them, but the actual traversal relies on current. The head simply marks the start of the list, and tail marks the end.