What is the trade-off of using a dummy node versus not using one in insertion at the head?

• A. A dummy node increases complexity and has no benefits.
• B. A dummy node simplifies edge cases and head insertions; without one you must treat head specially, but you save a node.
• C. Using a dummy node makes insertion slower by a constant factor but no other effect.
• D. Dummy node guarantees O(1) time but requires dynamic memory management.

Answer: (B)

Using a dummy (sentinel) node as a fixed anchor makes insertion at the head simpler and less error-prone. With a dummy in place, you always insert after the dummy, so you don’t need a special case for when the list is empty or when the new element becomes the first real node. This unifies the insertion logic across all positions and reduces the risk of mistakes when updating the head pointer.

The trade-off is memory and a tiny constant-factor cost. You pay for one extra node that doesn’t hold meaningful data, and every operation must traverse or reference the dummy as part of the path, which adds a small overhead. Without a dummy, you save that node and avoid that extra indirection, but you must explicitly handle the head as a special case—checking for an empty list and updating the head pointer manually—which increases code complexity and the chance of subtle bugs.